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.

A356505 a(n) = A356500(2*n+1, 2*n) for n >= 0.

Original entry on oeis.org

1, 6, 135, 4284, 160965, 6684744, 296679006, 13805453160, 665611197093, 32988925715610, 1671463040525586, 86231285273788180, 4516133521439246825, 239551205985729110664, 12846081444122599438850, 695428535332816056597520, 37960416340437631597631877
Offset: 0

Views

Author

Paul D. Hanna, Aug 09 2022

Keywords

Comments

Triangle A356500 describes the coefficients in G(x,y) that satisfies: y = Sum_{n=-oo..+oo} (-x)^(n^2) * G(x,y)^((n-1)^2).

Crossrefs

Programs

  • PARI
    {A356500(n,k) = my(A=[y],M); for(i=1,n, A = concat(A,0); M = ceil(sqrt(n+1));
    A[#A] = -polcoeff( sum(m=-M,M, (-x)^(m^2)*Ser(A)^((m-1)^2)), #A-1)); polcoeff(A[n+1],k,y) }
    for(n=0,20, print1( A356500(2*n+1, 2*n),", "))