login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #6 Mar 30 2012 18:39:17

%S 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,

%T 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,

%U 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

%N 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).

%F For k>=2, a(2^k-1)=2*4^(k-2).

%Y Cf. A082388.

%K nonn

%O 0,3

%A _Benoit Cloitre_, Apr 14 2003