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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039897 Number of partitions satisfying 0 < cn(2,5) + cn(3,5). 0
0, 1, 2, 3, 4, 7, 11, 17, 23, 32, 44, 63, 85, 114, 149, 198, 260, 341, 436, 559, 712, 910, 1149, 1446, 1803, 2254, 2803, 3478, 4282, 5267, 6453, 7905, 9635, 11716, 14191, 17180, 20735, 24985, 29998, 35965, 43019, 51404, 61257, 72880, 86510 (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 < 2 + 3 (OMBBp).

CROSSREFS

Sequence in context: A025048 A017987 A165407 * A050193 A173173 A192669

Adjacent sequences:  A039894 A039895 A039896 * A039898 A039899 A039900

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 14 11:17 EST 2012. Contains 205623 sequences.