%I A100824
%S A100824 1,1,2,2,4,3,7,5,12,7,19,11,30,15,45,22,67,30,97,42,139,56,195,77,272,
%T A100824 101,373,135,508,176,684,231,915,297,1212,385,1597,490,2087,627,2714,
%U A100824 792,3506,1002,4508,1255,5763,1575,7338,1958,9296,2436,11732,3010,14742
%N A100824 Number of partitions of n with at most one odd part.
%F A100824 G.f.: (1+x/(1-x^2))/Product(1-x^(2*i), i=1..infinity). More generally, 
               g.f. for number of partitions of n with at most k odd parts is (1+Sum(x^i/
               Product(1-x^(2*j), j=1..i), i=1..k))/Product(1-x^(2*i), i=1..infinity).
%p A100824 seq(coeff(convert(series((1+x/(1-x^2))/mul(1-x^(2*i),i=1..100),x,100),
               polynom),x,n),n=1..60); (C. Ronaldo)
%Y A100824 Cf. A000041, A000070, A008951, A000097, A000098, A000710.
%Y A100824 Sequence in context: A057449 A007439 A096441 this_sequence A163227 A048675 
               A162474
%Y A100824 Adjacent sequences: A100821 A100822 A100823 this_sequence A100825 A100826 
               A100827
%K A100824 easy,nonn
%O A100824 1,3
%A A100824 Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 13 2005
%E A100824 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005