login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027353 Number of partitions of n into distinct odd parts, the least being 9. 0
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.

CROSSREFS

Sequence in context: A232440 A090329 A224876 * A027352 A029238 A238552

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 31 23:52 EDT 2014. Contains 245101 sequences.