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!)
A161286 Number of partitions of n into numbers not divisible by 3 where every part appears at least 8 times 1
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 8, 6, 8, 7, 10, 8, 10, 9, 14, 11, 13, 12, 16, 15, 16, 15, 21, 18, 22, 19, 25, 22, 26, 24, 33, 26, 34, 29, 41, 34, 42, 39, 53, 46, 57, 50, 67, 59, 75, 68, 89, 79, 96, 89, 111, 101, 121, 113, 144, 131, 153, 144, 174 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,16

LINKS

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

CROSSREFS

Sequence in context: A161233 A161057 A161261 * A185216 A247976 A280986

Adjacent sequences:  A161283 A161284 A161285 * A161287 A161288 A161289

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 November 30 02:18 EST 2021. Contains 349416 sequences. (Running on oeis4.)