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 A000425 M4507 N1908 #34 May 09 2020 15:12:15
%S A000425 2,0,0,8,30,192,1344,10800,97434,976000,10749024,129103992,1679495350,
%T A000425 23525384064,353028802560,5650370001120,96082828074162,
%U A000425 1729886440780800,32874134679574208,657589108734075240,13811277748363437006,303884178002526338624
%N A000425 Coefficients of ménage hit polynomials.
%D A000425 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 197.
%D A000425 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000425 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%F A000425 It appears that a(n) = round(4*n*exp(-2)*(BesselK(n-1,2)+BesselK(n,2))) when n >= 10. - _Mark van Hoeij_, Oct 25 2011
%F A000425 Conjecture: (n-1)*(n-3)*a(n) -n*(n-2)*(n-3)*a(n-1) -n*(n-1)*(n-3)*a(n-2) -n *(n-1)*a(n-3)=0. - _R. J. Mathar_, Nov 02 2015
%F A000425 Conjecture: a(n) = 2*n*A000271(n). - _R. J. Mathar_, Nov 02 2015
%t A000425 p[n_] := Sum[2*n/(2*n-k)*Binomial[2*n-k, k]*(n-k)!*(x-1)^k, {k, 0, n}] // CoefficientList[#, x]&; Array[p, 25][[All, 2]] (* _Jean-François Alcover_, Feb 08 2016 *)
%Y A000425 A diagonal of A058087. Cf. A000179.
%K A000425 nonn
%O A000425 1,1
%A A000425 _N. J. A. Sloane_, _Simon Plouffe_