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 A170749 #28 Sep 08 2022 08:45:49
%S A170749 1,30,870,25230,731670,21218430,615334470,17844699630,517496289270,
%T A170749 15007392388830,435214379276070,12621216999006030,366015292971174870,
%U A170749 10614443496164071230,307818861388758065670,8926746980273983904430,258875662427945533228470
%N A170749 Expansion of g.f.: (1+x)/(1-29*x).
%H A170749 Kenny Lau, <a href="/A170749/b170749.txt">Table of n, a(n) for n = 0..683</a>
%H A170749 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (29).
%F A170749 a(n) = Sum_{k=0..n} A097805(n,k)*(-1)^(n-k)*30^k. - _Philippe Deléham_, Dec 04 2009
%F A170749 a(0) = 1; for n > 0, a(n) = 30*29^(n-1). - _Vincenzo Librandi_, Dec 05 2009
%F A170749 E.g.f.: (30*exp(29*x) -1)/29. - _G. C. Greubel_, Sep 25 2019
%p A170749 k:=30; seq(`if`(n=0, 1, k*(k-1)^(n-1)), n = 0..25); # _G. C. Greubel_, Sep 25 2019
%t A170749 With[{k=30}, Table[If[n==0,1, k*(k-1)^(n-1)], {n,0,25}]] (* _G. C. Greubel_, Sep 25 2019 *)
%t A170749 Join[{1},NestList[29#&,30,20]] (* _Harvey P. Dale_, Aug 27 2020 *)
%o A170749 (Python) for i in range(31):print(i,30*29**(i-1) if i>0 else 1) # _Kenny Lau_, Aug 03 2017
%o A170749 (PARI) vector(26, n, k=30; if(n==1, 1, k*(k-1)^(n-2))) \\ _G. C. Greubel_, Sep 25 2019
%o A170749 (Magma) k:=30; [1] cat [k*(k-1)^(n-1): n in [1..25]]; // _G. C. Greubel_, Sep 25 2019
%o A170749 (Sage) k=30; [1]+[k*(k-1)^(n-1) for n in (1..25)] # _G. C. Greubel_, Sep 25 2019
%o A170749 (GAP) k:=30;; Concatenation([1], List([1..25], n-> k*(k-1)^(n-1) )); # _G. C. Greubel_, Sep 25 2019
%Y A170749 Cf. A003945, A097805.
%K A170749 nonn,easy
%O A170749 0,2
%A A170749 _N. J. A. Sloane_, Dec 04 2009