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.
%I A370040 #31 Feb 11 2024 00:15:26
%S A370040 1,0,1,3,0,1,-1,9,0,1,9,-6,18,0,1,-3,54,-19,30,0,1,22,-54,185,-44,45,
%T A370040 0,1,-9,264,-294,475,-85,63,0,1,52,-324,1463,-1026,1020,-146,84,0,1,
%U A370040 -22,1127,-2715,5531,-2781,1939,-231,108,0,1,111,-1534,9648,-13430,16470,-6384,3374,-344,135,0,1,-51,4338,-19005,51853,-49032,41567,-13020,5490,-489,165,0,1
%N A370040 Triangle of coefficients T(n,k) in g.f. A(x,y) satisfying Sum_{n=-oo..+oo} (-1)^n * (x^n + y*A(x,y))^n = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2), for n >= 1, as read by rows.
%C A370040 A370021(n) = Sum_{k=0..n-1} T(n,k), for n >= 1.
%C A370040 A370022(n) = Sum_{k=0..n-1} T(n,k) * 2^k, for n >= 1.
%C A370040 A370023(n) = Sum_{k=0..n-1} T(n,k) * 3^k, for n >= 1.
%C A370040 A370024(n) = Sum_{k=0..n-1} T(n,k) * 4^k, for n >= 1.
%C A370040 A370025(n) = Sum_{k=0..n-1} T(n,k) * 5^k, for n >= 1.
%C A370040 A370026(n) = Sum_{k=0..n-1} T(n,k) * 6^k, for n >= 1.
%C A370040 A370027(n) = Sum_{k=0..n-1} T(n,k) * 7^k, for n >= 1.
%C A370040 A370028(n) = Sum_{k=0..n-1} T(n,k) * 8^k, for n >= 1.
%C A370040 A370029(n) = Sum_{k=0..n-1} T(n,k) * 9^k, for n >= 1.
%C A370040 A370042(n) = Sum_{k=0..n-1} T(n,k) * 10^k, for n >= 1.
%H A370040 Paul D. Hanna, <a href="/A370040/b370040.txt">Table of n, a(n) for n = 1..2485</a>
%F A370040 G.f. A(x,y) = Sum_{n>=1} Sum_{k=0..n-1} T(n,k) * x^n*y^k satisfies the following formulas.
%F A370040 (1) Sum_{n=-oo..+oo} (-1)^n * (x^n + y*A(x,y))^n = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2).
%F A370040 (2) Sum_{n=-oo..+oo} (-1)^n * x^n * (x^n + y*A(x,y))^(n-1) = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2).
%F A370040 (3) Sum_{n=-oo..+oo} (-1)^n * x^n * (x^n + y*A(x,y))^n = 0.
%F A370040 (4) Sum_{n=-oo..+oo} (-1)^n * x^(n^2) / (1 + y*A(x,y)*x^n)^n = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2).
%F A370040 (5) Sum_{n=-oo..+oo} (-1)^n * x^(n^2) / (1 + y*A(x,y)*x^n)^(n+1) = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2).
%F A370040 (6) Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)) / (1 + y*A(x,y)*x^n)^(n+1) = 0.
%F A370040 (7) A(x,y) = (1/y) * Integral Q(x) / Sum_{n=-oo..+oo} (-1)^n * n * (x^n + y*A(x,y))^(n-1) dy, where Q(x) = Sum_{n>=1} (-1)^n * x^(n^2).
%F A370040 (8) A(x,y=0) = (1 - theta_4(x))/2 / Product_{n>=1} (1 - x^(2*n))^3, which is the g.f. of column 0 (A370150) defined at y = 0.
%e A370040 G.f.: A(x,y) = x*(1) + x^2*(0 + y) + x^3*(3 + y^2) + x^4*(-1 + 9*y + y^3) + x^5*(9 - 6*y + 18*y^2 + y^4) + x^6*(-3 + 54*y - 19*y^2 + 30*y^3 + y^5) + x^7*(22 - 54*y + 185*y^2 - 44*y^3 + 45*y^4 + y^6) + x^8*(-9 + 264*y - 294*y^2 + 475*y^3 - 85*y^4 + 63*y^5 + y^7) + x^9*(52 - 324*y + 1463*y^2 - 1026*y^3 + 1020*y^4 - 146*y^5 + 84*y^6 + y^8) + x^10*(-22 + 1127*y - 2715*y^2 + 5531*y^3 - 2781*y^4 + 1939*y^5 - 231*y^6 + 108*y^7 + y^9) + ...
%e A370040 where
%e A370040 Sum_{n=-oo..+oo} (-1)^n * (x^n + y*A(x,y))^n = 1 + (y+2)*Sum_{n>=1} (-1)^n * x^(n^2).
%e A370040 TRIANGLE.
%e A370040 This triangle of coefficients T(n,k) of x^n*y^k in g.f. A(x,y) begins
%e A370040 1;
%e A370040 0, 1;
%e A370040 3, 0, 1;
%e A370040 -1, 9, 0, 1;
%e A370040 9, -6, 18, 0, 1;
%e A370040 -3, 54, -19, 30, 0, 1;
%e A370040 22, -54, 185, -44, 45, 0, 1;
%e A370040 -9, 264, -294, 475, -85, 63, 0, 1;
%e A370040 52, -324, 1463, -1026, 1020, -146, 84, 0, 1;
%e A370040 -22, 1127, -2715, 5531, -2781, 1939, -231, 108, 0, 1;
%e A370040 111, -1534, 9648, -13430, 16470, -6384, 3374, -344, 135, 0, 1;
%e A370040 -51, 4338, -19005, 51853, -49032, 41567, -13020, 5490, -489, 165, 0, 1;
%e A370040 230, -6274, 55413, -128974, 208178, -146098, 92869, -24300, 8475, -670, 198, 0, 1; ...
%o A370040 (PARI) /* Generate A(x,y) by use of definition in name */
%o A370040 {T(n,k) = my(A=[0,1]); for(i=1,n, A = concat(A,0);
%o A370040 A[#A] = polcoeff( sum(m=-#A,#A, (-1)^m * (x^m + y*Ser(A))^m ) - 1 - (y+2)*sum(m=1,#A, (-1)^m * x^(m^2) ), #A-1)/y ); H=A; polcoeff(A[n+1],k,y)}
%o A370040 for(n=1,15, for(k=0,n-1, print1(T(n,k),", "));print(""))
%o A370040 (PARI) /* Generate A(x,y) recursively using integration wrt y */
%o A370040 {T(n,k) = my(A = x +x*O(x^n), M=sqrtint(n+1), Q = sum(m=1,M, (-1)^m * x^(m^2)) +x*O(x^n));
%o A370040 for(i=0,n, A = (1/y) * intformal( Q / sum(m=-M,n, (-1)^m * m * (x^m + y*A)^(m-1)), y) +x*O(x^n));
%o A370040 polcoeff(polcoeff(A,n,x),k,y)}
%o A370040 for(n=1,15, for(k=0,n-1, print1(T(n,k),", "));print(""))
%Y A370040 Cf. A370020, A370021, A370022, A370023, A370024, A370025, A370026, A370027, A370028, A370029, A370042.
%Y A370040 Cf. A370150 (column 0), A370151 (column 1), A370152 (column 2).
%Y A370040 Cf. A370041 (dual triangle).
%K A370040 sign,tabl
%O A370040 1,4
%A A370040 _Paul D. Hanna_, Feb 09 2024