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 A013736 #29 Sep 08 2022 08:44:38 %S A013736 5,625,78125,9765625,1220703125,152587890625,19073486328125, %T A013736 2384185791015625,298023223876953125,37252902984619140625, %U A013736 4656612873077392578125,582076609134674072265625,72759576141834259033203125 %N A013736 a(n) = 5^(3*n + 1). %H A013736 Vincenzo Librandi, <a href="/A013736/b013736.txt">Table of n, a(n) for n = 0..100</a> %H A013736 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013736 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (125). %F A013736 From _Philippe Deléham_, Nov 25 2008: (Start) %F A013736 a(n) = 125*a(n-1); a(0)=5. %F A013736 G.f.: 5/(1-125*x). (End) %p A013736 seq(5^(3*n+1),n=0..12); # _Nathaniel Johnston_, Jun 26 2011 %t A013736 5^(3Range[0,15]+1) (* or *) NestList[125 #&,5,15] (* _Harvey P. Dale_, Jun 25 2011 *) %o A013736 (Magma) [5^(3*n+1): n in [0..20]]; // _Vincenzo Librandi_, May 25 2011 %o A013736 (PARI) a(n)=5^(3*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016 %Y A013736 Cf. A013737. %K A013736 nonn,easy %O A013736 0,1 %A A013736 _N. J. A. Sloane_