The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A356505 a(n) = A356500(2*n+1, 2*n) for n >= 0. 3
 1, 6, 135, 4284, 160965, 6684744, 296679006, 13805453160, 665611197093, 32988925715610, 1671463040525586, 86231285273788180, 4516133521439246825, 239551205985729110664, 12846081444122599438850, 695428535332816056597520, 37960416340437631597631877 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 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). LINKS PROG (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), ", ")) CROSSREFS Cf. A356500, A356504, A356506. Sequence in context: A220064 A050281 A096756 * A241999 A333005 A013299 Adjacent sequences:  A356502 A356503 A356504 * A356506 A356507 A356508 KEYWORD nonn AUTHOR Paul D. Hanna, Aug 09 2022 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 13:27 EST 2022. Contains 358362 sequences. (Running on oeis4.)