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

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

%S 0,1,1,1,2,3,5,7,9,15,18,25,33,47,66,81,102,135,180,240,291,363,462,

%T 599,761,929,1138,1421,1780,2214,2679,3261,3989,4902,5970,7195,8666,

%U 10475,12642,15202,18172,21736,25954,30961,36803

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

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

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

%K nonn

%O 1,5

%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 May 10 09:34 EDT 2024. Contains 372377 sequences. (Running on oeis4.)