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

 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
 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, 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, 10, 15, 12, 17, 13, 20, 16, 22, 17, 25, 21, 28, 23, 31 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,37 LINKS Table of n, a(n) for n=1..80. MAPLE Nmax := 501 : g := 1; for e from 11 to Nmax by 2 do g := g*(1+x^e) ; g := taylor(%, x=0, Nmax+1) ; g := convert(%, polynom, x) ; end do: g := x^9+x^9*(g-1) : g := taylor(g, x=0, Nmax) : gfun[seriestolist](g) ; # R. J. Mathar, Oct 03 2016 CROSSREFS Cf. A027351, A027352. Sequence in context: A090329 A224876 A340830 * A027352 A029238 A345137 Adjacent sequences: A027350 A027351 A027352 * A027354 A027355 A027356 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 8 08:54 EDT 2024. Contains 375753 sequences. (Running on oeis4.)