0,3

Sum of products of multiplicities of odd parts in all partitions of n (if there are no odd parts in a partition then product of multiplicities is considered to be 1). - Vladeta Jovovic, Feb 16 2005

The sequence A077285 is the same but with multiplicities of all parts.

George E. Andrews, Generalized Frobenius partitions, Memoirs of the American Mathematical Society, Number 301, May 1984.

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Brian Drake, Limits of areas under lattice paths, Discrete Math. 309 (2009), no. 12, 3936-3953. See formula (18) on page 3944.

Expansion of q^(1/12) * eta(q^4) * eta(q^6)^2 / (eta(q) * eta(q^2) * eta(q^3) * eta(q^12)) in powers of q. - Michael Somos, Mar 09 2011

Euler transform of period 12 sequence [ 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, ...]. - Michael Somos, Mar 09 2011

G.f.: (Product_{k>0} (1 - x^k) * (1 - x^(12*k - 10)) * (1 - x^(12*k - 9)) * (1 - x^(12*k - 3)) * (1 - x^(12*k - 2)))^(-1). [Andrews, p. 10, equation (5.9)]

a(n) ~ exp(2*Pi*sqrt(2*n)/3) / (6*sqrt(2)*n). - Vaclav Kotesovec, Nov 28 2015

Empirical: Sum_{n>=0} a(n) / exp(n*Pi) = exp(-Pi/12) * Gamma(2/3)^(2/3) * Gamma(3/4)^(1/3) * Gamma(7/12)^(2/3) * 6^(1/4) / Pi^(7/12) / (sqrt(2) * (3^(1/2)-1))^(2/3) = A388445. - Simon Plouffe, Sep 15 2025

1 + x + 3*x^2 + 5*x^3 + 9*x^4 + 14*x^5 + 24*x^6 + 35*x^7 + 55*x^8 + ...

q^-1 + q^11 + 3*q^23 + 5*q^35 + 9*q^47 + 14*q^59 + 24*q^71 + 35*q^83 + ...

a(6) = 24 since the 5 partitions 6 = 5+1 = 4+2 = 3+2+1 = 2+2+2 each contribute 1, the 3 partitions 4+1+1 = 3+3 = 2+2+1+1 each contribute 2, the partition 3+1+1+1 contributes 3, the partition 2+1+1+1+1 contributes 4, and the partition 1+1+1+1+1+1 contributes 6 to give total 24 = 5*1 + 3*2 + 1*3 + 1*4 + 1*6. - Michael Somos, Mar 09 2011

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, b(n, i-1)

+add(b(n-i*j, i-1)*`if`(irem(i, 2)=1, j, 1), j=1..n/i)))

end:

a:= n-> b(n, n):

seq(a(n), n=0..50); # Alois P. Heinz, Jul 16 2013

b[n_, i_] := b[n, i] = If[n==0, 1, If[i<1, 0, b[n, i-1] + Sum[b[n-i*j, i-1] * If[Mod[i, 2] == 1, j, 1], {j, 1, n/i}]]]; a[n_] := b[n, n]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Jul 15 2015, after Alois P. Heinz *)

QP = QPochhammer; s = QP[q^4] * (QP[q^6]^2 / (QP[q] * QP[q^2] * QP[q^3] * QP[q^12])) + O[q]^50; CoefficientList[s, q] (* Jean-François Alcover, Nov 09 2015, adapted from PARI *)

(PARI) {a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^4 + A) * eta(x^6 + A)^2 / (eta(x + A) * eta(x^2 + A) * eta(x^3 + A) * eta(x^12 + A)), n))} /* Michael Somos, Mar 09 2011 */

Cf. A077285, A052992, A097242, A247661, A247662.

Sequence in context: A144116 A294424 A061556 * A327562 A071155 A120695

Adjacent sequences: A053990 A053991 A053992 * A053994 A053995 A053996

easy,nonn

James Sellers, Apr 04 2000

approved