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 A213432 N0837 #20 Feb 22 2024 09:01:41
%S A213432 0,0,0,0,2,20,120,560,2240,8064,26880,84480,253440,732160,2050048,
%T A213432 5591040,14909440,38993920,100270080,254017536,635043840,1568931840,
%U A213432 3835166720,9285140480,22284337152,53057945600,125409689600,294440140800,687026995200,1593902628864,3678236835840,8446321623040,19305877995520,43937515438080,99591701659648
%N A213432 a(n) = 2^(n-3)*binomial(n,4).
%D A213432 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%H A213432 Paolo Xausa, <a href="/A213432/b213432.txt">Table of n, a(n) for n = 0..1000</a>
%H A213432 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (10,-40,80,-80,32).
%F A213432 G.f.: -2*x^4 / (2*x-1)^5. - _Colin Barker_, Jul 22 2013
%F A213432 a(n) = 2*A003472(n). - _R. J. Mathar_, Jun 18 2014
%t A213432 A213432[n_] := 2^(n-3)*Binomial[n, 4]; Array[A213432, 35, 0] (* or *)
%t A213432 LinearRecurrence[{10, -40, 80, -80, 32}, {0, 0, 0, 0, 2}, 35] (* _Paolo Xausa_, Feb 22 2024 *)
%K A213432 nonn,easy
%O A213432 0,5
%A A213432 _N. J. A. Sloane_, Jun 11 2012