Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161281
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161281 Number of partitions of n into numbers not divisible by 3 where every part appears at least 3 times +0
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; listen)
OFFSET

1,6

LINKS

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

CROSSREFS

Sequence in context: A029172 A161052 A161256 this_sequence A003113 A152227 A078660

Adjacent sequences: A161278 A161279 A161280 this_sequence A161282 A161283 A161284

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research