Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161283 Number of partitions of n into numbers not divisible by 3 where every part appears at least 5 times +0
1
0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 6, 5, 6, 6, 8, 9, 9, 9, 11, 11, 15, 13, 16, 15, 18, 21, 22, 22, 25, 25, 35, 32, 39, 37, 44, 50, 53, 56, 63, 66, 79, 76, 88, 89, 103, 112, 121, 124, 137, 144, 167, 167, 185, 191, 212, 230, 245, 256, 278, 292, 331, 335, 370, 383, 418, 451 (list; graph; listen)
OFFSET

1,10

LINKS

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

CROSSREFS

Sequence in context: A161230 A161054 A161258 this_sequence A002300 A049099 A143179

Adjacent sequences: A161280 A161281 A161282 this_sequence A161284 A161285 A161286

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Jun 06 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research