This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082386 Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity). 0
 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 128, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 512, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 1, 1, 2, 1, 1, 2, 8, 1, 1, 2, 1, 1, 2, 8, 32, 128, 1, 1, 2, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA For k>=2, a(2^k-1)=2*4^(k-2). CROSSREFS Cf. A082388. Sequence in context: A323739 A122160 A058316 * A233308 A028306 A111259 Adjacent sequences:  A082383 A082384 A082385 * A082387 A082388 A082389 KEYWORD nonn AUTHOR Benoit Cloitre, Apr 14 2003 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 June 16 04:54 EDT 2019. Contains 324145 sequences. (Running on oeis4.)