login
The OEIS is supported by the many generous donors to the OEIS 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 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!)
A161281 Number of partitions of n into numbers not divisible by 3 where every part appears at least 3 times 1
0, 0, 1, 1, 1, 2, 1, 2, 2, 3, 3, 5, 4, 5, 7, 8, 7, 10, 10, 14, 14, 15, 17, 23, 23, 27, 30, 36, 36, 46, 48, 56, 61, 68, 76, 90, 91, 105, 116, 134, 140, 159, 172, 196, 214, 235, 254, 292, 306, 345, 376, 418, 446, 500, 541, 601, 643, 710, 766, 860, 910, 999, 1088, 1194, 1282, 1409 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

CROSSREFS

Sequence in context: A275380 A161052 A161256 * A226916 A003113 A225502

Adjacent sequences: A161278 A161279 A161280 * A161282 A161283 A161284

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 02:09 EST 2022. Contains 358406 sequences. (Running on oeis4.)