login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161288 Number of partitions of n into numbers not divisible by 3 where every part appears at least 10 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 9, 7, 9, 8, 11, 9, 11, 10, 13, 11, 15, 13, 16, 14, 17, 17, 19, 17, 20, 19, 25, 21, 25, 23, 28, 26, 30, 27, 33, 28, 39, 32, 41, 34, 44, 41, 50, 44, 54, 48, 66, 55, 70, 62, 79, 72, 87, 81, 99, 89, 114 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,20

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A161235 A161059 A161263 * A185217 A131456 A074944

Adjacent sequences:  A161285 A161286 A161287 * A161289 A161290 A161291

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 06 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 18:13 EST 2021. Contains 349445 sequences. (Running on oeis4.)