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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039902 Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5). 0
1, 1, 2, 4, 6, 9, 13, 19, 27, 39, 52, 71, 95, 127, 170, 220, 286, 371, 474, 614, 770, 979, 1229, 1541, 1934, 2392, 2968, 3668, 4504, 5556, 6764, 8271, 10055, 12199, 14798, 17836, 21504, 25860, 30996, 37185, 44348, 52943, 63003, 74856, 88874 (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: o < 1 + 4 + 2 and o < 1 + 4 + 3 (OMBBAAp).

CROSSREFS

Sequence in context: A026906 A171861 A039900 * A081659 A143586 A081225

Adjacent sequences:  A039899 A039900 A039901 * A039903 A039904 A039905

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 13 12:58 EST 2012. Contains 205482 sequences.