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 A013855 #21 Mar 02 2025 21:30:52 %S A013855 100,10000000,1000000000000,100000000000000000, %T A013855 10000000000000000000000,1000000000000000000000000000, %U A013855 100000000000000000000000000000000,10000000000000000000000000000000000000,1000000000000000000000000000000000000000000,100000000000000000000000000000000000000000000000 %N A013855 a(n) = 10^(5*n + 2). %H A013855 Vincenzo Librandi, <a href="/A013855/b013855.txt">Table of n, a(n) for n = 0..50</a> %H A013855 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013855 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (100000). %F A013855 From _Elmo R. Oliveira_, Feb 27 2025: (Start) %F A013855 G.f.: 100/(1 - 100000*x). %F A013855 E.g.f.: 100*exp(100000*x). %F A013855 a(n) = A011557(A016873(n)). (End) %t A013855 10^(5*Range[0, 10] + 2) (* _Paolo Xausa_, Mar 02 2025 *) %o A013855 (Magma) [10^(5*n+2): n in [0..10]]; // _Vincenzo Librandi_, Jul 08 2011 %Y A013855 Subsequence of A011557. %Y A013855 Cf. A016873. %K A013855 nonn,easy %O A013855 0,1 %A A013855 _N. J. A. Sloane_