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

%I

%S 0,1,1,1,1,3,2,4,5,5,8,10,11,17,18,25,29,38,45,56,69,84,101,127,148,

%T 183,219,264,314,382,447,542,639,760,902,1067,1256,1489,1742,2060,

%U 2402,2832,3298,3862,4507

%N Number of partitions satisfying cn(0,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: 0 = 1 + 4 (AApEZ).

%K nonn

%O 1,6

%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 July 2 16:14 EDT 2020. Contains 335404 sequences. (Running on oeis4.)