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

%I #6 Mar 30 2012 17:20:56

%S 1,2,3,4,5,7,10,14,17,21,27,37,47,57,68,85,108,135,160,190,230,285,

%T 345,407,475,567,684,816,950,1104,1297,1541,1810,2094,2411,2807,3285,

%U 3821,4386,5024,5791,6713,7732,8828,10049

%N Number of partitions satisfying cn(2,5) + cn(3,5) <= 1.

%C For a given partition cn(i,n) means the number of its parts equal to i modulo n.

%C Short: 2 + 3 <= u (BBpU).

%K nonn

%O 1,2

%A _Olivier GĂ©rard_

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)