|
Search: id:A036563
|
|
| |
|
| -2, -1, 1, 5, 13, 29, 61, 125, 253, 509, 1021, 2045, 4093, 8189, 16381, 32765, 65533, 131069, 262141, 524285, 1048573, 2097149, 4194301, 8388605, 16777213, 33554429, 67108861, 134217725, 268435453, 536870909, 1073741821, 2147483645
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n+1) is the n-th number with exactly n 1's in binary representation. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 06 2003
Berstein and Onn: "For every m = 3k+1, the Graver complexity of the vertex-edge incidence matrix of the complete bipirtite graph K(3,m) satisfies g(m) >= 2^(k+2)-3." - Jonathan Vos Post (jvospost2(AT)yahoo.com), Sep 15 2007
Row sums of triangle A135857. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 01 2007
|
|
LINKS
|
Yael Berstein, Shmuel Onn, The Graver Complexity of Integer Programming.
|
|
FORMULA
|
a(n)=2*a(n-1)+3
The sequence 1, 5, 13, ... has a(n)=4*2^n-3. These are the partial sums of A046055. - Paul Barry (pbarry(AT)wit.ie), Aug 25 2003
Row sums of triangle A130459 starting (1, 5, 13, 29, 61,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 26 2007
Row sums of triangle A131112 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 15 2007
Binomial transform of [1, 4, 4, 4,...] = (1, 5, 13, 29, 61...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 20 2007
a(n) = 2*StirlingS2(n,2) - 1, for n > 0. - Ross La Haye (rlahaye(AT)new.rr.com), Jul 05 2008
|
|
CROSSREFS
|
Row sums of triangular array A027960. A column of A119725.
a(n) = A118654(n-3, 6), for n > 2.
Cf. A081118, A130459, A131112.
Cf. A050414, A050415.
Cf. A135857.
Sequence in context: A024462 A049252 A098315 this_sequence A025264 A139622 A139547
Adjacent sequences: A036560 A036561 A036562 this_sequence A036564 A036565 A036566
|
|
KEYWORD
|
sign,new
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
