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 A180413 #23 Jun 12 2021 02:45:59
%S A180413 0,144,576,1440,2880,5040,8064,12096,17280,23760,31680,41184,52416,
%T A180413 65520,80640,97920,117504,139536,164160,191520,221760,255024,291456,
%U A180413 331200,374400,421200,471744,526176,584640,647280,714240,785664,861696
%N A180413 Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.
%C A180413 The maximum number of move in tridimensional chessboard is 24, 8 for every dimension. In a vertex the number is smaller.
%C A180413 Binomial transform of [144, 432, 432, 144, 0, 0, 0, ...] = (144, 576, 1440, ...). - _Gary W. Adamson_, Sep 03 2010
%H A180413 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A180413 a(n) = 24*n*(n^2-1).
%F A180413 G.f.: 144*x^2/(1-x)^4. - _Colin Barker_, Mar 17 2012
%F A180413 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4); a(1)=0, a(2)=144, a(3)=576, a(4)=1440. - _Harvey P. Dale_, Feb 13 2013
%F A180413 E.g.f.: 24 * exp(x) * x^2 * (3 + x). - _Vaclav Kotesovec_, Feb 15 2015
%t A180413 Table[24n(n^2-1),{n,40}] (* or *) LinearRecurrence[{4,-6,4,-1},{0,144,576,1440},40] (* _Harvey P. Dale_, Feb 13 2013 *)
%o A180413 (PARI) a(n)=24*n*(n^2-1) \\ _Charles R Greathouse IV_, Nov 03 2014
%Y A180413 Cf. A027480, A135503, A180319, A035008.
%K A180413 easy,nice,nonn
%O A180413 1,2
%A A180413 Graziano Aglietti (mg5055(AT)mclink.it), Sep 02 2010