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 A013715 #34 Aug 26 2024 16:53:42 %S A013715 10,1000,100000,10000000,1000000000,100000000000,10000000000000, %T A013715 1000000000000000,100000000000000000,10000000000000000000, %U A013715 1000000000000000000000,100000000000000000000000,10000000000000000000000000,1000000000000000000000000000,100000000000000000000000000000 %N A013715 a(n) = 10^(2*n+1). %C A013715 Bisection of A011557 (powers of 10). - _Michel Marcus_, Jan 17 2016 %H A013715 Vincenzo Librandi, <a href="/A013715/b013715.txt">Table of n, a(n) for n = 0..100</a> %H A013715 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013715 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (100). %F A013715 From _Philippe Deléham_, Nov 25 2008: (Start) %F A013715 G.f.: 10/(1-100*x). %F A013715 a(n) = 100*a(n-1), n>0; a(0)=10. (End) %F A013715 From _Elmo R. Oliveira_, Aug 26 2024 (Start) %F A013715 E.g.f.: 10*exp(100*x). %F A013715 a(n) = 10*A098608(n) = A011557(A005408(n)) = A013747(n)/10^(n+1). (End) %p A013715 seq(10^(2*n+1),n=0..11); # _Nathaniel Johnston_, Jun 25 2011 %t A013715 10^(2 Range[0, 15] + 1) (* _Wesley Ivan Hurt_, Jan 17 2016 *) %o A013715 (Magma) [10^(2*n+1): n in [0..20]]; // _Vincenzo Librandi_, Jun 26 2011 %o A013715 (PARI) a(n) = 10^(2*n+1); \\ _Michel Marcus_, Jan 17 2016 %o A013715 (PARI) Vec(10/(1-100*x) + O(x^100)) \\ _Altug Alkan_, Jan 17 2016 %Y A013715 Cf. A013708-A013714, A013716-A013729, A011557. %Y A013715 Cf. A005408, A098608, A013747. %K A013715 nonn,easy %O A013715 0,1 %A A013715 _N. J. A. Sloane_