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

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

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

%T 3,1,3,1,4,2,4,2,5,3,5,4,6,5,6,6,7,8,7,9,9,11,9,13,11,15,12,17,15,20,

%U 16,22,20,25,22,28,27,32,30,35,36,40,40,44,48

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

%p Nmax := 501 :

%p g := 1;

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

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

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

%Y Cf. A027351, A027353.

%K nonn

%O 1,31

%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 18 18:13 EDT 2024. Contains 371781 sequences. (Running on oeis4.)