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 A001908 M3677 N1500 #35 Jan 17 2020 10:36:50
%S A001908 1,4,41,614,12281,307024,9210721,322375234,12895009361,580275421244,
%T A001908 29013771062201,1595757408421054,95745444505263241,
%U A001908 6223453892842110664,435641772498947746481,32673132937421080986074,2613850634993686478885921,222177303974463350705303284
%N A001908 E.g.f. exp(-x)/(1-5*x).
%D A001908 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 83.
%D A001908 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001908 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001908 T. D. Noe, <a href="/A001908/b001908.txt">Table of n, a(n) for n = 0..100</a>
%F A001908 E.g.f.: A(x) = exp(-x)/(1-5x) satisfies (1-5x)A' - (4+5x)A = 0. - _Gheorghe Coserea_, Aug 06 2015
%F A001908 a(n+1) = (5n+4) a(n) + 5n a(n-1). - _Gheorghe Coserea_, Aug 06 2015
%F A001908 a(n) = 5^n*exp(-1/5)*Gamma(n+1,-1/5), where Gamma is the incomplete Gamma function. - _Robert Israel_, Aug 06 2015
%F A001908 a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * (5*k - 1) * a(n-k). - _Ilya Gutkovskiy_, Jan 17 2020
%p A001908 f:= gfun:-rectoproc({a(n+1) = (5*n+4)* a(n) + 5*n*a(n-1),a(0)=1,a(1)=4},a(n),remember):
%p A001908 seq(f(n),n=0..30); # _Robert Israel_, Aug 06 2015
%t A001908 nn = 20; Range[0, nn]! CoefficientList[Series[Exp[-x]/(1 - 5 x), {x, 0, nn}], x] (* _T. D. Noe_, Aug 17 2012 *)
%o A001908 (PARI) x='x+O('x^33); Vec(serlaplace(exp(-x)/(1-5*x))) \\ _Gheorghe Coserea_, Aug 06 2015
%Y A001908 Column k=5 of A320032.
%K A001908 nonn
%O A001908 0,2
%A A001908 _N. J. A. Sloane_