login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

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

CROSSREFS

Sequence in context: A007601 A195944 A087830 * A255216 A017836 A321481

Adjacent sequences:  A039854 A039855 A039856 * A039858 A039859 A039860

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 05:33 EDT 2020. Contains 335513 sequences. (Running on oeis4.)