cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 2, 1, 1, 3, 3, 1, 2, 4, 4, 3, 3, 6, 6, 4, 6, 9, 9, 7, 8, 12, 12, 10, 12, 17, 18, 15, 17, 23, 24, 21, 25, 32, 33, 31, 34, 43, 45, 42, 48, 58, 61, 58, 64, 77, 80, 78, 87, 102, 107, 106, 115, 134, 141, 139, 153, 175
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Formula

a(n) = (A000700(n)+(-1)^n*A053250(n))/2. - Vladeta Jovovic, Mar 12 2006
a(n) + A027357(n) = A000700(n). - R. J. Mathar, Oct 03 2016
a(n) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+3). - Sean A. Irvine, Oct 28 2019