The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140531 Concatenate subsequences 0, 1, 2, 4, ..., 2^k. 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 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] 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 CROSSREFS Cf. A000079, A059268. Sequence in context: A304784 A131644 A115346 * A117316 A109189 A264157 Adjacent sequences:  A140528 A140529 A140530 * A140532 A140533 A140534 KEYWORD nonn AUTHOR Paul Curtz, Jul 03 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 18 02:57 EST 2020. Contains 332006 sequences. (Running on oeis4.)