A140531 Concatenate subsequences 0, 1, 2, 4, ..., 2^k.

0, 0, 1, 0, 1, 2, 0, 1, 2, 4, 0, 1, 2, 4, 8, 0, 1, 2, 4, 8, 16, 0, 1, 2, 4, 8, 16, 32, 0, 1, 2, 4, 8, 16, 32, 64, 0, 1, 2, 4, 8, 16, 32, 64, 128, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024

Offset: 0

Author

Paul Curtz, Jul 03 2008

Keywords

• nonn
• tabl

Comments

A sequence B is called a reluctant sequence of sequence A, if B is triangle array read by rows: row number k coincides with first k elements of the sequence A. Sequence A140531 is the reluctant sequence of A131577. - Boris Putievskiy, Dec 12 2012

Links

• Boris Putievskiy, Transformations Integer Sequences And Pairing Functions, arXiv:1212.2732 [math.CO], 2012.

Crossrefs

Cf. A000079, A059268.

Formula

a(n) = floor(2^(n-2-t*(t+1)/2)), where t=floor((-1+sqrt(8*n-7))/2), n>=1. - Boris Putievskiy, Dec 13 2012