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
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, 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, 29, 29, 33, 35, 37, 39, 43, 47, 48, 52, 55, 61, 62, 68, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,25
LINKS
MAPLE
Nmax := 501 :
g := 1;
for e from 7 to Nmax by 2 do
g := g*(1+x^e) ;
g := taylor(%, x=0, Nmax+1) ;
g := convert(%, polynom, x) ;
end do:
g := x^5+x^5*(g-1) :
g := taylor(g, x=0, Nmax) :
gfun[seriestolist](g) ; # R. J. Mathar, Oct 03 2016
CROSSREFS
Sequence in context: A362181 A079413 A337787 * A029349 A372205 A168676
KEYWORD
nonn
AUTHOR
STATUS
approved

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 June 29 09:33 EDT 2024. Contains 373837 sequences. (Running on oeis4.)