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

%I #5 Mar 30 2012 17:20:49

%S 1,1,1,2,3,4,4,5,7,11,13,15,17,23,34,40,44,52,67,98,111,124,143,184,

%T 257,290,321,372,467,640,715,793,911,1133,1509,1684,1860,2134,2617,

%U 3424,3801,4202,4796,5828,7484

%N Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,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 and 2<=1 and 2<=4).

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)