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.

Showing 1-1 of 1 results.

A261037 The number of overpartitions of n with restricted odd differences and smallest part both odd and overlined.

Original entry on oeis.org

1, 1, 3, 4, 7, 10, 17, 23, 36, 48, 73, 96, 140, 182, 259, 334, 463, 592, 806, 1024, 1370, 1728, 2281, 2860, 3727, 4646, 5991, 7430, 9487, 11706, 14822, 18205, 22870, 27966, 34890, 42492, 52670, 63896, 78743, 95178, 116659, 140516, 171380, 205750
Offset: 1

Views

Author

Jeremy Lovejoy, Aug 07 2015

Keywords

Comments

The number of overpartitions of n such that: (i) the difference between successive parts may be odd only if the larger part is overlined and (ii) the smallest part of the overpartition is both odd and overlined.

Crossrefs

Formula

G.f.: 1 + 3*Sum_{n >= 1} a(n)*q^n = (Product_{n >= 1} (1-q^(3*n))/((1-q^n)*(1-q^(2*n)))) * (1 + 2*Sum_{n >= 1} q^(n*(n+1)/2)*(1-q^2)*(1-q^4)*...*(1-q^(2*n-2))*(1-q^n)/((1-q^3)*(1-q^6)*...*(1-q^(3*n)))) = A260890(q)*A260983(q).
Showing 1-1 of 1 results.