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!)
A027351 Number of partitions of n into distinct odd parts, the least being 5. 2

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

%S 0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,1,0,1,0,1,1,1,1,1,2,1,2,1,3,1,3,2,4,2,

%T 4,3,5,4,5,5,6,6,6,8,8,9,8,11,10,13,11,15,14,17,15,20,19,22,21,26,26,

%U 29,29,33,35,37,39,43,47,48,52,55,61,62,68,71

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

%p Nmax := 501 :

%p g := 1;

%p for e from 7 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^5+x^5*(g-1) :

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

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

%Y Cf. A027352, A027353.

%K nonn

%O 1,25

%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 July 17 04:19 EDT 2024. Contains 374360 sequences. (Running on oeis4.)