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 A054885 #33 Feb 08 2023 09:34:55
%S A054885 0,0,0,10,40,260,1240,6510,32240,162760,812240,4069010,20337240,
%T A054885 101725260,508587240,2543131510,12715462240,63578287760,317890462240,
%U A054885 1589457194010,7947281087240,39736429850260
%N A054885 Number of walks of length n along the edges of an icosahedron between two opposite vertices.
%H A054885 Vincenzo Librandi, <a href="/A054885/b054885.txt">Table of n, a(n) for n = 0..1000</a>
%H A054885 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,10,-20,-25).
%F A054885 G.f.: (1/12)*(1/(1-5*t) + 5/(1+t) - 6/(1-5*t^2)).
%F A054885 a(n) = (5^n + 5*(-1)^n - 3*(1 + (-1)^n)*sqrt(5)^n)/12.
%F A054885 a(n+1) = 5 * A030518(n) for n > 0.
%F A054885 a(n) = 4*a(n-1) + 10*a(n-2) - 20*a(n-3) - 25*a(n-4). - _François Marques_, Jul 10 2021
%F A054885 E.g.f.: (1/12)*(5*exp(-x) + exp(5*x) - 6*cosh(sqrt(5)*x)). - _G. C. Greubel_, Feb 07 2023
%t A054885 LinearRecurrence[{4,10,-20,-25}, {0,0,0,10}, 41] (* _G. C. Greubel_, Feb 07 2023 *)
%o A054885 (Magma) [Floor((5^n+(-1)^n*5-3*(1+(-1)^n)*Sqrt(5)^n)/12): n in [0..30]]; // _Vincenzo Librandi_, Aug 24 2011
%o A054885 (PARI) a(n) = if(n%2, 5^n-5, 5^n+5-6*5^(n/2))/12; \\ _François Marques_, Jul 11 2021
%o A054885 (SageMath)
%o A054885 def A054885(n): return (5^n +5*(-1)^n -3*(1+(-1)^n)*5^(n/2))/12
%o A054885 [A054885(n) for n in range(41)] # _G. C. Greubel_, Feb 07 2023
%Y A054885 Cf. A030517, A030518, A054881, A054882, A054883, A054884.
%K A054885 nonn,walk,easy
%O A054885 0,4
%A A054885 Paolo Dominici (pl.dm(AT)libero.it), May 23 2000