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 A013856 #26 Mar 04 2025 11:47:29 %S A013856 1000,100000000,10000000000000,1000000000000000000, %T A013856 100000000000000000000000,10000000000000000000000000000, %U A013856 1000000000000000000000000000000000,100000000000000000000000000000000000000,10000000000000000000000000000000000000000000,1000000000000000000000000000000000000000000000000 %N A013856 a(n) = 10^(5*n + 3). %H A013856 Vincenzo Librandi, <a href="/A013856/b013856.txt">Table of n, a(n) for n = 0..50</a> %H A013856 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013856 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (100000). %F A013856 From _Elmo R. Oliveira_, Mar 02 2025: (Start) %F A013856 G.f.: 1000/(1 - 100000*x). %F A013856 E.g.f.: 1000*exp(100000*x). %F A013856 a(n) = A011557(A016885(n)). (End) %t A013856 10^(5*Range[0, 10] + 3) (* _Paolo Xausa_, Mar 04 2025 *) %o A013856 (Magma) [10^(5*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jul 08 2011 %o A013856 (Maxima) makelist(10^(5*n+3),n,0,20); /* _Martin Ettl_, Oct 21 2012 */ %Y A013856 Subsequence of A011557. %Y A013856 Cf. A016885. %K A013856 nonn,easy %O A013856 0,1 %A A013856 _N. J. A. Sloane_