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!)
A039893 Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5). 0

%I

%S 1,1,1,3,4,6,8,11,17,24,31,42,56,76,101,129,167,217,279,360,449,571,

%T 719,900,1130,1394,1730,2144,2630,3241,3948,4827,5882,7127,8642,10425,

%U 12575,15141,18138,21749,25974,31011,36946,43877,52083

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

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

%C Short: 2 + 3 < 1 + 4 (BBpMAAp).

%K nonn

%O 1,4

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 14:40 EDT 2021. Contains 348170 sequences. (Running on oeis4.)