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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036889 Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) = cn(2,5) = cn(3,5). 7
0, 1, 4, 12, 29, 66, 137, 279, 546, 1057, 2000, 3746, 6886, 12508, 22360, 39477, 68736, 118309, 201207, 338672, 564211, 931342, 1523628, 2472228, 3979651, 6359094, 10088975, 15899507, 24894711, 38740189, 59929503, 92185390, 141029958, 214628608 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) <= cn(0,5) = cn(1,5) = cn(4,5).

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

LINKS

Index and properties of sequences related to partitions of 5n

FORMULA

a(n) = A036882(n) - A036887(n)

a(n) = A036881(n) - A036885(n)

a(n) = A046776(n) + A036892(n)

CROSSREFS

Sequence in context: A128563 A192978 A062421 * A036895 A061726 A067706

Adjacent sequences:  A036886 A036887 A036888 * A036890 A036891 A036892

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Terms a(10) onward from Max Alekseyev (maxale(AT)gmail.com), Dec 11 2011

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 17:13 EST 2012. Contains 205828 sequences.