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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039867 Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5). 0
1, 1, 2, 4, 5, 8, 11, 16, 22, 29, 40, 57, 74, 96, 125, 166, 215, 277, 351, 449, 570, 721, 901, 1131, 1409, 1750, 2163, 2671, 3283, 4034, 4923, 6003, 7298, 8862, 10724, 12949, 15582, 18737, 22482, 26931, 32153, 38344, 45639, 54260, 64366 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: 2 + 3 <= 0 + 1 + 4 (BBpZAAp).

CROSSREFS

Sequence in context: A175106 A205728 A074824 * A080136 A080033 A007379

Adjacent sequences:  A039864 A039865 A039866 * A039868 A039869 A039870

KEYWORD

nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

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 15 11:25 EST 2012. Contains 205777 sequences.