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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039857 Number of partitions satisfying cn(2,5) + cn(3,5) <= 1. 0
1, 2, 3, 4, 5, 7, 10, 14, 17, 21, 27, 37, 47, 57, 68, 85, 108, 135, 160, 190, 230, 285, 345, 407, 475, 567, 684, 816, 950, 1104, 1297, 1541, 1810, 2094, 2411, 2807, 3285, 3821, 4386, 5024, 5791, 6713, 7732, 8828, 10049 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: 2 + 3 <= u (BBpU).
LINKS
CROSSREFS
Sequence in context: A007601 A195944 A087830 * A255216 A017836 A321481
KEYWORD
nonn
AUTHOR
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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)