login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027353 Number of partitions of n into distinct odd parts, the least being 9. 2

%I #10 Oct 03 2016 16:03:22

%S 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,

%T 1,1,2,1,2,1,3,1,3,1,4,1,4,2,5,2,5,3,6,4,6,5,7,6,7,8,8,9,8,11,10,13,

%U 10,15,12,17,13,20,16,22,17,25,21,28,23,31

%N Number of partitions of n into distinct odd parts, the least being 9.

%p Nmax := 501 :

%p g := 1;

%p for e from 11 to Nmax by 2 do

%p g := g*(1+x^e) ;

%p g := taylor(%,x=0,Nmax+1) ;

%p g := convert(%,polynom,x) ;

%p end do:

%p g := x^9+x^9*(g-1) :

%p g := taylor(g,x=0,Nmax) :

%p gfun[seriestolist](g) ; # _R. J. Mathar_, Oct 03 2016

%Y Cf. A027351, A027352.

%K nonn

%O 1,37

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)