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 A013857 #19 Mar 02 2025 21:31:00
%S A013857 10000,1000000000,100000000000000,10000000000000000000,
%T A013857 1000000000000000000000000,100000000000000000000000000000,
%U A013857 10000000000000000000000000000000000,1000000000000000000000000000000000000000,100000000000000000000000000000000000000000000
%N A013857 a(n) = 10^(5*n + 4).
%H A013857 Vincenzo Librandi, <a href="/A013857/b013857.txt">Table of n, a(n) for n = 0..50</a>
%H A013857 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A013857 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (100000).
%F A013857 From _Elmo R. Oliveira_, Mar 02 2025: (Start)
%F A013857 G.f.: 10000/(1 - 100000*x).
%F A013857 E.g.f.: 10000*exp(100000*x).
%F A013857 a(n) = A011557(A016897(n)). (End)
%t A013857 10^(5 Range[0,10]+4) (* or *) LinearRecurrence[{100000},{10000},20] (* _Harvey P. Dale_, Mar 15 2023 *)
%o A013857 (Magma) [10^(5*n+4): n in [0..10]]; // _Vincenzo Librandi_, Jul 08 2011
%Y A013857 Subsequence of A011557.
%Y A013857 Cf. A016897.
%K A013857 nonn,easy
%O A013857 0,1
%A A013857 _N. J. A. Sloane_