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.

A335728 a(n) is the number of smallest parts in the overpartitions of n having even smallest part.

Original entry on oeis.org

0, 2, 0, 6, 4, 12, 12, 30, 36, 60, 80, 132, 180, 264, 360, 522, 712, 990, 1344, 1844, 2472, 3324, 4420, 5892, 7764, 10212, 13344, 17400, 22556, 29160, 37524, 48166, 61560, 78456, 99648, 126234, 159396, 200740, 252096, 315828
Offset: 1

Views

Author

Jeremy Lovejoy, Jun 19 2020

Keywords

Examples

			There are 14 overpartitions of 4: [4], [4'], [3,1], [3,1'], [3',1], [3',1'], [2,2], [2',2], [2,1,1], [2,1',1], [2',1,1], [2',1',1], [1,1,1,1], [1',1,1,1], and so a(4) = 6.
		

Crossrefs

Formula

G.f.: 2*(Product_{k>=1} (1+q^k)/(1-q^k))*Sum_{n>=1} (q^(2*n)*Product_{j=1..2*n}(1-q^j))/((1-q^(2*n))^2*Product_{j=1..2*n}(1+q^j)).
a(n) = A335724(n) - A335730(n).