|
Search: id:A127330
|
|
|
| A127330 |
|
Begin with the empty sequence and a starting number s = 0. At step k (k >= 1) append the k consecutive numbers s to s+k-1 and change the starting number (for the next step) to 2s+2. |
|
+0
3
|
|
| 0, 2, 3, 6, 7, 8, 14, 15, 16, 17, 30, 31, 32, 33, 34, 62, 63, 64, 65, 66, 67, 126, 127, 128, 129, 130, 131, 132, 254, 255, 256, 257, 258, 259, 260, 261, 510, 511, 512, 513, 514, 515, 516, 517, 518, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 2046
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
From a TV show.
A129142 and A129143 are similar, slightly more natural, but for a puzzle perhaps too transparent sequences.
|
|
EXAMPLE
|
In step 1 starting number 0 is appended to the empty sequence and the next starting number is 2*0+2 = 2. In step 2 the two numbers 2, 3 are appended and the starting number is changed to 2*2+2 = 6.
|
|
PROGRAM
|
(PARI) {v=[]; s=0; for(k=1, 11, w=vector(k, j, j+s-1); s=2*s+2; v=concat(v, w)); for(n=1, #v, print1(v[n], ", "))} /* Klaus Brockhaus, Mar 31 2007 */
(MAGMA) &cat[ [2^k-2..2^k+k-3]: k in [1..11] ]; /* Klaus Brockhaus, Mar 31 2007 */
|
|
CROSSREFS
|
Cf. A129142, A129143.
Sequence in context: A138683 A072426 A166458 this_sequence A035346 A066646 A110920
Adjacent sequences: A127327 A127328 A127329 this_sequence A127331 A127332 A127333
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
Steven Cartier (steven.cartier(AT)rogers.com), Mar 30 2007
|
|
EXTENSIONS
|
Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 31 2007
|
|
|
Search completed in 0.002 seconds
|
