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 A092366 #32 Sep 08 2022 08:45:13
%S A092366 1,1,8,81,1120,19375,400896,9630411,262955008,8032730715,271175200000,
%T A092366 10017828457483,401738097475584,17371952344599385,805429080795852800,
%U A092366 39844314853048828125,2094272851244149112832,116526044312704751752451
%N A092366 Coefficient of x^n in expansion of (1+n*x+n*x^2)^n.
%C A092366 Also coefficient of x^n in expansion of (1-2*n*x+(n^2-4*n)*x^2)^(-1/2). - _Vladeta Jovovic_, Mar 22 2004
%H A092366 Seiichi Manyama, <a href="/A092366/b092366.txt">Table of n, a(n) for n = 0..381</a> (terms 1..100 from Vincenzo Librandi)
%F A092366 a(n) = n^(n/2)*GegenbauerPoly(n,-n,-sqrt(n)/2). - _Emanuele Munarini_, Oct 20 2016
%F A092366 Sum_{k=floor(n/2)..n} n^k*binomial(n, k)*binomial(k, n-k). - _Vladeta Jovovic_, Mar 22 2004
%F A092366 a(n) ~ n^(n-1/4) * exp(2*sqrt(n)-2) / (2*sqrt(Pi)). - _Vaclav Kotesovec_, Apr 17 2014
%p A092366 seq(n!*coeff(series(exp(n*x)*BesselI(0,2*sqrt(n)*x),x,n+1),x,n),n=1..17);
%t A092366 Table[Sum[n^k*Binomial[n,k]*Binomial[k,n-k],{k,Floor[n/2],n}],{n,1,20}] (* _Vaclav Kotesovec_, Apr 17 2014 *)
%t A092366 Table[If[n == 0, 1, n^(n/2) GegenbauerC[n, -n, -Sqrt[n]/2]], {n, 0,
%t A092366 12}] (* _Emanuele Munarini_, Oct 20 2016 *)
%o A092366 (PARI) q(n)=(1+n*x+n*x^2)^n; for(i=0,20,print1(","polcoeff(q(i),i)))
%o A092366 (Magma) P<x>:=PolynomialRing(Integers()); [ Coefficients((1+n*x+n*x^2)^n)[n+1]: n in [1..22] ]; // _Klaus Brockhaus_, Mar 03 2011
%o A092366 (Maxima) a(n):=coeff(expand((1+n*x+n*x^2)^n), x, n);
%o A092366 makelist(a(n), n, 1, 12); /* _Emanuele Munarini_, Mar 02 2011 */
%Y A092366 Cf. A186925, A187018.
%K A092366 nonn
%O A092366 0,3
%A A092366 _Jon Perry_, Mar 19 2004
%E A092366 a(0)=1 prepended by _Seiichi Manyama_, May 01 2019