0,3

G. E. Andrews, MacMahon's Partition Analysis II: Fundamental Theorems, Annals Combinatorics, 4 (2000), 327-338.

G.f.: 1/((1-x)*((1-x^2)*...*(1-x^m))^2*(1-x^(m+1))) for m = 6.

a:= n-> (Matrix(48, (i, j)-> if (i=j-1) then 1 elif j=1 then [1, 2, 0, -1, -3, -1, -2, 0, 5, 6, 5, 1, -5, -11, -9, -7, 2, 9, 15, 16, 4, -5, -13, -16, -13, -5, 4, 16, 15, 9, 2, -7, -9, -11, -5, 1, 5, 6, 5, 0, -2, -1, -3, -1, 0, 2, 1, -1][i] else 0 fi)^n)[1, 1]: seq(a(n), n=0..39); # Alois P. Heinz, Jul 31 2008

m = 6; n = 40; gf = 1/((1-x)*Product[1-x^k, {k, 2, m}]^2*(1-x^(m+1))) + O[x]^n; CoefficientList[gf, x] (* Jean-François Alcover, Jul 17 2015 *)

Cf. A008763, A001993, A070557, A070558.

Sequence in context: A233758 A301653 A253769 * A320788 A000990 A129361

Adjacent sequences: A070556 A070557 A070558 * A070560 A070561 A070562

N. J. A. Sloane, May 07 2002

approved