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 A170744 #24 Sep 08 2022 08:45:49
%S A170744 1,25,600,14400,345600,8294400,199065600,4777574400,114661785600,
%T A170744 2751882854400,66045188505600,1585084524134400,38042028579225600,
%U A170744 913008685901414400,21912208461633945600,525893003079214694400,12621432073901152665600,302914369773627663974400
%N A170744 Expansion of g.f.: (1+x)/(1-24*x).
%H A170744 Kenny Lau, <a href="/A170744/b170744.txt">Table of n, a(n) for n = 0..724</a>
%H A170744 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (24).
%F A170744 a(n) = Sum_{k=0..n} A097805(n,k)*(-1)^(n-k)*25^k. - _Philippe Deléham_, Dec 04 2009
%F A170744 a(0) = 1; for n>0, a(n) = 25*24^(n-1). - _Vincenzo Librandi_, Dec 05 2009
%F A170744 E.g.f.: (25*exp(24*x) - 1)/24. - _G. C. Greubel_, Sep 25 2019
%p A170744 k:=25; seq(`if`(n=0, 1, k*(k-1)^(n-1)), n = 0..25); # _G. C. Greubel_, Sep 25 2019
%t A170744 Join[{1},NestList[24#&,25,30]] (* _Harvey P. Dale_, Jan 19 2019 *)
%o A170744 (Python) for i in range(31):print(i,25*24**(i-1) if i>0 else 1) # _Kenny Lau_, Aug 03 2017
%o A170744 (PARI) vector(26, n, k=25; if(n==1, 1, k*(k-1)^(n-2))) \\ _G. C. Greubel_, Sep 25 2019
%o A170744 (Magma) k:=25; [1] cat [k*(k-1)^(n-1): n in [1..25]]; // _G. C. Greubel_, Sep 25 2019
%o A170744 (Sage) k=25; [1]+[k*(k-1)^(n-1) for n in (1..25)] # _G. C. Greubel_, Sep 25 2019
%o A170744 (GAP) k:=25;; Concatenation([1], List([1..25], n-> k*(k-1)^(n-1) )); # _G. C. Greubel_, Sep 25 2019
%Y A170744 Cf. A003945, A097805.
%K A170744 nonn,easy
%O A170744 0,2
%A A170744 _N. J. A. Sloane_, Dec 04 2009