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.

A341496 Number of partitions of n with exactly one repeated part and that part is even.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 1, 2, 4, 5, 6, 9, 12, 16, 20, 26, 34, 43, 53, 67, 82, 101, 124, 151, 184, 222, 267, 320, 381, 454, 539, 637, 752, 884, 1038, 1214, 1417, 1651, 1920, 2227, 2578, 2979, 3437, 3957, 4547, 5218, 5980, 6840, 7815, 8914, 10154, 11552, 13122
Offset: 0

Views

Author

Andrew Howroyd, Feb 13 2021

Keywords

Examples

			The a(4) = 1 partition is: 2+2.
The a(5) = 1 partition is: 1+2+2.
The a(6) = 1 partition is: 2+2+2.
The a(7) = 2 partitions are: 2+2+3, 1+2+2+2.
The a(8) = 4 partitions are: 4+4, 2+2+4, 1+2+2+3, 2+2+2+2.
		

Crossrefs

Programs

  • PARI
    seq(n)={Vec(sum(k=1, n\4, x^(4*k)/(1 - x^(4*k)) + O(x*x^n)) * prod(k=1, n, 1 + x^k + O(x*x^n)), -(n+1))}

Formula

G.f.: (Sum_{k>=1} x^(4*k)/(1 - x^(4*k))) * Product_{k>=1} (1 + x^k).
a(n) = A090867(n) - A341497(n).
a(n) = A341497(n) - A116680(n).
a(n) = A341494(n) for even n; a(n) = A341495(n) for odd n.