login
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
OFFSET
0,3
FORMULA
For k>=2, a(2^k-1)=2*4^(k-2).
CROSSREFS
Cf. A082388.
Sequence in context: A323739 A122160 A058316 * A336521 A356093 A233308
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 14 2003
STATUS
approved