login

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

Number of ways to write n as a sum a_1 + ... + a_k where a_i >= 2 * a_{i-1} > 1.
0

%I #3 Jun 14 2013 10:41:15

%S 1,1,1,1,1,1,2,2,2,3,3,3,4,4,5,6,6,7,8,8,9,11,11,12,14,14,15,17,18,19,

%T 22,23,24,27,28,30,33,35,37,40,42,44,48,50,53,58,60,63,68,71,74,80,84,

%U 87,93,97,101,107,112,117,124,129,135,143,148,155,164,170,177,187,194

%N Number of ways to write n as a sum a_1 + ... + a_k where a_i >= 2 * a_{i-1} > 1.

%F G.f.: x+(1/(1+x))/Product_{k>0}(1-x^(2^k-1)).

%Y Cf. A000929, A154402.

%K easy,nonn

%O 0,7

%A _Vladeta Jovovic_, Jan 08 2009

%E More terms from _R. J. Mathar_, Jan 21 2009