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 A013747 #25 Jul 08 2025 10:01:14 %S A013747 100,100000,100000000,100000000000,100000000000000,100000000000000000, %T A013747 100000000000000000000,100000000000000000000000, %U A013747 100000000000000000000000000,100000000000000000000000000000,100000000000000000000000000000000,100000000000000000000000000000000000 %N A013747 a(n) = 10^(3*n + 2). %H A013747 Vincenzo Librandi, <a href="/A013747/b013747.txt">Table of n, a(n) for n = 0..100</a> %H A013747 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013747 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1000). %F A013747 From _Philippe Deléham_, Nov 30 2008: (Start) %F A013747 a(n) = 1000*a(n-1); a(0)=100. %F A013747 G.f.: 100/(1-1000*x). %F A013747 a(n) = 10*A013746(n). (End) %F A013747 From _Elmo R. Oliveira_, Jul 07 2025: (Start) %F A013747 E.g.f.: 100*exp(1000*x). %F A013747 a(n) = A013731(n)*A013737(n) = A011557(A016789(n)). (End) %o A013747 (Magma) [10^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011 %o A013747 (PARI) a(n)=10^(3*n+2) \\ _Charles R Greathouse IV_, Jul 10 2016 %Y A013747 Subsequence of A011557 (10^n). %Y A013747 Cf. A013731, A013737, A013746, A016789. %K A013747 nonn,easy %O A013747 0,1 %A A013747 _N. J. A. Sloane_