This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 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 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: A278538 A090329 A224876 * A027352 A029238 A208478 Adjacent sequences:  A027350 A027351 A027352 * A027354 A027355 A027356 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.