Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046768 Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4). +0
1
1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 5, 5, 5, 9, 11, 12, 12, 19, 26, 28, 29, 40, 55, 62, 64, 81, 113, 132, 139, 163, 221, 265, 284, 320, 421, 514, 563, 619, 783, 965, 1074, 1169, 1432, 1765, 1996, 2167, 2575, 3159, 3613, 3931, 4566, 5552, 6410, 7006, 7990, 9605 (list; graph; listen)
OFFSET

0,6

CROSSREFS

Sequence in context: A029078 A131799 A078635 this_sequence A045812 A064877 A008363

Adjacent sequences: A046765 A046766 A046767 this_sequence A046769 A046770 A046771

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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research