login
This site is supported by donations 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
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, 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, 16, 22, 20, 25, 22, 28, 27, 32, 30, 35, 36, 40, 40, 44, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,31

LINKS

Table of n, a(n) for n=1..79.

MAPLE

Nmax := 501 :

g := 1;

for e from 9 to Nmax by 2 do

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

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

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

end do:

g := x^7+x^7*(g-1) :

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

gfun[seriestolist](g) ; # R. J. Mathar, Oct 03 2016

CROSSREFS

Cf. A027351, A027353.

Sequence in context: A090329 A224876 A027353 * A029238 A208478 A274450

Adjacent sequences:  A027349 A027350 A027351 * A027353 A027354 A027355

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 07:48 EDT 2019. Contains 328315 sequences. (Running on oeis4.)