login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039841 Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5). 0
0, 1, 2, 3, 4, 7, 10, 15, 21, 30, 41, 56, 74, 101, 134, 177, 228, 297, 382, 493, 626, 794, 999, 1260, 1575, 1967, 2439, 3022, 3724, 4587, 5618, 6874, 8374, 10189, 12351, 14953, 18041, 21740, 26116, 31329, 37483, 44793, 53392, 63555, 75482 (list; graph; refs; listen; history; text; 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: 0 < 2 + 3 (ZMBBp).

LINKS

Table of n, a(n) for n=1..45.

CROSSREFS

Sequence in context: A330357 A145467 A325341 * A078159 A129490 A018132

Adjacent sequences: A039838 A039839 A039840 * A039842 A039843 A039844

KEYWORD

nonn

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)