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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161050 Number of partitions of n into odd numbers where every part appears at least 14 times 1
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 6, 5, 6, 7, 7, 7, 8, 7, 8, 10, 8, 9, 10, 9, 11, 11, 10, 11, 13, 13, 13, 14, 13, 15, 17, 15, 16, 17, 17, 19, 19, 18, 20, 21, 21, 21, 22, 21, 23, 26 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,42 LINKS R. H. Hardin, Table of n, a(n) for n=1..1000 CROSSREFS Sequence in context: A097795 A161076 A161115 * A161075 A161114 A161049 Adjacent sequences: A161047 A161048 A161049 * A161051 A161052 A161053 KEYWORD nonn AUTHOR R. H. Hardin Jun 02 2009 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 December 1 01:13 EST 2022. Contains 358453 sequences. (Running on oeis4.)