login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of partitions of n into an odd number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an even number of parts, each <=5.
1

%I #7 Aug 22 2019 08:18:26

%S 0,0,0,0,1,0,1,1,3,3,6,6,10,10,16,17,25,27,37,40,53,57,73,79,99,107,

%T 131,142,171,184,218,235,275,296,343,368,422,452,514,550,621,663,743,

%U 792,883,939,1041,1106,1220,1294,1421,1505,1646,1740

%N Number of partitions of n into an odd number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an even number of parts, each <=5.

%F a(n) + A026929(n) =A026811(n). - _R. J. Mathar_, Aug 22 2019

%Y 5th column of A262920.

%K nonn

%O 1,9

%A _Clark Kimberling_