[go: up one dir, main page]

login
A369086
Expansion of g.f. A(x) satisfying 2 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n-1)/2) * A(x)^n.
2
1, 2, 2, 12, 22, 144, 314, 2094, 4980, 33962, 85104, 589050, 1526520, 10690958, 28357414, 200513838, 540848844, 3855418084, 10529575602, 75589847732, 208400923746, 1505463570864, 4180703306104, 30372614867534, 84817986727644, 619420989037864, 1737266065061962
OFFSET
0,2
LINKS
FORMULA
G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies:
(1) 2 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n-1)/2) * A(x)^n.
(2) 2 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) / A(x)^n.
(3) 2 = Product_{n>=1} (1 + (-x)^(n-1)*A(x)) * (1 + (-x)^n/A(x)) * (1 - (-x)^n), by the Jacobi Triple Product identity.
EXAMPLE
G.f.: A(x) = 1 + 2*x + 2*x^2 + 12*x^3 + 22*x^4 + 144*x^5 + 314*x^6 + 2094*x^7 + 4980*x^8 + 33962*x^9 + 85104*x^10 + 589050*x^11 + 1526520*x^12 + ...
PROG
(PARI) {a(n) = my(A=[1]); for(i=1, n, A=concat(A, 0);
A[#A] = polcoeff(2 - sum(m=-#A, #A, (-x)^(m*(m-1)/2) * Ser(A)^m ), #A-1)); H=A; A[n+1]}
for(n=0, 40, print1(a(n), ", "))
CROSSREFS
Cf. A354645.
Sequence in context: A140431 A092900 A303537 * A355871 A164961 A362192
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jan 22 2024
STATUS
approved