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 A320337 #29 Nov 13 2024 22:31:50
%S A320337 1,1,7,161,7631,607009,72605303,12172272321,2722634203807,
%T A320337 783282749905601,281751782666559239,123890976070562785633,
%U A320337 65380371270827869603439,40779819387085820255904481,29677003954344675666092048791,24921035407468294238607282809729
%N A320337 a(n) = A271697(2*n, n).
%C A320337 Central coefficients of the triangles A046739 and A271697.
%H A320337 Andrew Howroyd, <a href="/A320337/b320337.txt">Table of n, a(n) for n = 0..100</a>
%F A320337 a(n) = Sum_{k=0..n} (-1)^(n-k)*E(n+k, n)*binomial(2*n,n-k) where E are the Eulerian numbers A173018. - _Peter Luschny_, Dec 19 2018
%F A320337 a(n) ~ sqrt(3) * 2^(2*n + 1) * n^(2*n) / exp(2*n + 1). - _Vaclav Kotesovec_, Dec 19 2018
%p A320337 a := n -> add((-1)^(n-k)*combinat:-eulerian1(n+k,n)*binomial(2*n,n-k), k=0..n): seq(a(n), n=0..15); # _Peter Luschny_, Dec 19 2018
%t A320337 E1[n_ /; n >= 0, 0] = 1; E1[n_, k_] /; k < 0 || k > n = 0; E1[n_, k_] := E1[n, k] = (n - k) E1[n - 1, k - 1] + (k + 1) E1[n - 1, k];
%t A320337 a[n_] := Sum[(-1)^(n - k) E1[n + k, n] Binomial[2 n, n - k], {k, 0, n}];
%t A320337 Table[a[n], {n, 0, 15}] (* _Jean-François Alcover_, Dec 30 2018, after _Peter Luschny_ *)
%Y A320337 Cf. A173018, A046739, A062868, A180056, A271697.
%K A320337 nonn
%O A320337 0,3
%A A320337 _Maxwell Jiang_, Dec 18 2018 (added without permission by editors)