NUMBER OF SUBSETS OF THE SET [n] INCLUDING NO TWO CONSECUTIVE ODD INTEGERS
From MaRDI portal
Publication:5076197
Recommendations
- The number of subsets of the set \([n]\) containing no two consecutive even integers
- scientific article; zbMATH DE number 892628
- The number of subsets of integers with no k-term arithmetic progression
- Counting sets of integers, no \(k\) of which sum to another
- Disjoint odd integer subsets having a constant even sum
- The number of relatively prime subsets of a finite union of sets of consecutive integers
- Disjoint odd integer subsets having a constant odd sum
- The Number of Relatively Prime Subsets of {1, 2, . . . , n}
- The number of \((2,3)\)-sum-free subsets of \(\{1,\dots,n\}\)
- Subset sums in \(\mathbb{N}^ 2\)
Cites work
Cited in
(4)
This page was built for publication: NUMBER OF SUBSETS OF THE SET [n] INCLUDING NO TWO CONSECUTIVE ODD INTEGERS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076197)