Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046765
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046765 Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3). +0
2
1, 0, 0, 0, 0, 0, 1, 0, 0, 3, 0, 0, 7, 0, 0, 13, 0, 0, 25, 0, 0, 43, 0, 0, 77, 0, 0, 130, 0, 0, 222, 0, 0, 365, 0, 0, 603, 0, 0, 966, 0, 0, 1546, 0, 0, 2425, 0, 0, 3783, 0, 0, 5813, 0, 0, 8884, 0, 0, 13411, 0, 0, 20130, 0, 0, 29922, 0, 0, 44217, 0, 0, 64814, 0, 0, 94485, 0, 0 (list; graph; listen)
OFFSET

0,10

CROSSREFS

Sequence in context: A060284 A036275 A131436 this_sequence A046777 A140577 A068606

Adjacent sequences: A046762 A046763 A046764 this_sequence A046766 A046767 A046768

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research