A027357 Number of partitions of n into distinct odd parts, the greatest being congruent to 1 mod 4.

1, 0, 0, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 2, 1, 2, 4, 3, 2, 3, 5, 5, 3, 5, 8, 6, 5, 7, 10, 10, 8, 11, 15, 14, 12, 15, 20, 20, 18, 22, 28, 27, 25, 30, 37, 38, 35, 42, 51, 50, 49, 56, 67, 69, 67, 77, 90, 91, 90, 102, 117, 121, 121, 135, 155, 159, 160, 177

Offset

1,9

Comments

Also number of self-conjugate partitions of n into an odd number of parts. - Vladeta Jovovic, Feb 18 2004

Links

Table of n, a(n) for n=1..68.

Formula

a(n) = (A000700(n)-(-1)^n*A053250(n))/2. - Vladeta Jovovic, Mar 12 2006

a(n) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+1). - Sean A. Irvine, Oct 28 2019

Crossrefs

Cf. A027356, A027358.

Cf. A000700, A053250.

Sequence in context: A286971 A025861 A090723 * A256479 A277078 A283715

Adjacent sequences: A027354 A027355 A027356 * A027358 A027359 A027360

Keyword

nonn

Author

Clark Kimberling

Status

approved