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.

A366736 Central terms of triangle A366730.

This page as a plain text file.
%I A366736 #9 Nov 12 2023 19:35:47
%S A366736 1,-2,14,-176,2615,-42444,734310,-13332898,251087228,-4863520344,
%T A366736 96340129818,-1943639738074,39815238143374,-826201916477272,
%U A366736 17334983283537509,-367213838120451038,7844257467257818627,-168807941163188191336,3656662240133060807499,-79675906058698383705100
%N A366736 Central terms of triangle A366730.
%C A366736 This sequence is defined by a(n) = [x^(2*n)*y^n] F(x,y) for n >= 0, where F(x,y) satisfies 0 = Sum_{n=-oo..+oo} x^n * F(x,y)^n * (y - x^(n-1))^(n+1), and F(x,y) is the g.f. of triangle A366730.
%H A366736 Paul D. Hanna, <a href="/A366736/b366736.txt">Table of n, a(n) for n = 0..50</a>
%F A366736 a(n) = A366730(2*n,n) for n >= 0.
%o A366736 (PARI) {A366730(n,k) = my(A=[1]); for(i=1,n, A = concat(A,0);
%o A366736 A[#A] = polcoeff( sum(n=-#A,#A, x^n * Ser(A)^n * (y - x^(n-1))^(n+1) ), #A-2)); polcoeff(A[n+1],k)}
%o A366736 for(n=0,20, print1(A366730(2*n,n),", "))
%Y A366736 Cf. A366730, A366731, A366732, A366733, A366734, A366735.
%K A366736 sign
%O A366736 0,2
%A A366736 _Paul D. Hanna_, Oct 30 2023