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 A013896 #25 Jul 13 2025 12:07:08 %S A013896 8000,25600000000,81920000000000000,262144000000000000000000, %T A013896 838860800000000000000000000000,2684354560000000000000000000000000000, %U A013896 8589934592000000000000000000000000000000000,27487790694400000000000000000000000000000000000000 %N A013896 a(n) = 20^(5*n + 3). %H A013896 Vincenzo Librandi, <a href="/A013896/b013896.txt">Table of n, a(n) for n = 0..50</a> %H A013896 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013896 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (3200000). %F A013896 a(n) = 3200000*a(n-1), a(0)=8000. - _Vincenzo Librandi_, May 27 2011 %F A013896 From _Elmo R. Oliveira_, Jul 11 2025: (Start) %F A013896 G.f.: 8000/(1-3200000*x). %F A013896 E.g.f.: 8000*exp(3200000*x). %F A013896 a(n) = A013824(n)*A013856(n) = A009964(A016885(n)). (End) %t A013896 20^(5Range[0,20]+3) (* or *) NestList[3200000#&,8000,20] (* _Harvey P. Dale_, Dec 05 2021 *) %o A013896 (Magma) [20^(5*n+3): n in [0..10]]; // _Vincenzo Librandi_, May 27 2011 %Y A013896 Subsequence of A009964. %Y A013896 Cf. A013824, A013856, A016885. %K A013896 nonn,easy %O A013896 0,1 %A A013896 _N. J. A. Sloane_