login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046765 Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3). 1
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; refs; listen; history; internal format)
OFFSET

0,10

CROSSREFS

Sequence in context: A036275 A131436 * A046777 A140577 A068606 A106153

Adjacent sequences:  A046762 A046763 A046764 * A046766 A046767 A046768

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.