cp's OEIS Frontend

A276431 Number of partitions of n containing no parts that are powers of 2 with positive exponent.

%I A276431 #16 Dec 21 2016 13:48:22
%S A276431 1,1,1,2,2,3,5,6,7,10,13,16,22,27,33,43,52,64,81,98,120,148,178,215,
%T A276431 263,315,377,455,541,644,771,912,1078,1279,1506,1772,2089,2447,2864,
%U A276431 3356,3916,4563,5320,6180,7171,8324,9633,11136,12874,14845,17102,19696
%N A276431 Number of partitions of n containing no parts that are powers of 2 with positive exponent.
%H A276431 Alois P. Heinz, <a href="/A276431/b276431.txt">Table of n, a(n) for n = 0..10000</a>
%F A276431 a(n) = A276430(n,0).
%F A276431 G.f.: g(x) = Product_{i>=1} (1-x^{h(i)})/(1-x^i), where h(i) = 2^i.
%e A276431 a(6) = 5, counting [1,1,1,1,1,1], [1,1,1,3], [1,5], [3,3], [6].
%p A276431 h:= proc(i) options operator, arrow: 2^i end proc: g := product((1-x^h(i))/(1-x^i), i = 1 .. 55): gser := series(g, x = 0, 55): seq(coeff(gser, x, n), n = 0 .. 50);
%p A276431 # second Maple program:
%p A276431 with(numtheory):
%p A276431 a:= proc(n) option remember; `if`(n=0, 1, add(add(`if`(d>1 and
%p A276431       d=2^ilog2(d), 0, a(n-j)*d), d=divisors(j)), j=1..n)/n)
%p A276431     end:
%p A276431 seq(a(n), n=0..55);  # _Alois P. Heinz_, Sep 20 2016
%t A276431 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[If[d>1 && d == 2^Floor[Log[2, d]], 0, a[n-j]*d], {d, Divisors[j]}], {j, 1, n}]/n]; Table[a[n], {n, 0, 55}] (* _Jean-François Alcover_, Dec 21 2016, after _Alois P. Heinz_ *)
%Y A276431 Cf. A276430.
%K A276431 nonn
%O A276431 0,4
%A A276431 _Emeric Deutsch_, Sep 19 2016