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 A013793 #27 Jul 21 2025 08:57:41 %S A013793 1000,10000000,100000000000,1000000000000000,10000000000000000000, %T A013793 100000000000000000000000,1000000000000000000000000000, %U A013793 10000000000000000000000000000000,100000000000000000000000000000000000,1000000000000000000000000000000000000000 %N A013793 a(n) = 10^(4*n + 3). %H A013793 Vincenzo Librandi, <a href="/A013793/b013793.txt">Table of n, a(n) for n = 0..100</a> %H A013793 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013793 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (10000). %F A013793 From _Elmo R. Oliveira_, Aug 30 2024: (Start) %F A013793 G.f.: 1000/(1 - 10000*x). %F A013793 E.g.f.: 1000*exp(10000*x). %F A013793 a(n) = 10000*a(n-1) for n > 0. %F A013793 a(n) = A011557(A004767(n)) = A013715(n)*A098608(n+1) = A013777(n)*A013783(n). (End) %t A013793 10^(4*Range[0, 10] + 3) (* or *) %t A013793 NestList[10000*# &, 1000, 10] (* _Paolo Xausa_, Jul 21 2025 *) %o A013793 (Magma) [10^(4*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jun 28 2011 %o A013793 (Maxima) makelist(10^(4*n+3),n,0,20); /* _Martin Ettl_, Oct 21 2012 */ %Y A013793 Cf. A004767, A011557, A013715, A013777, A013783, A098608. %K A013793 nonn,easy %O A013793 0,1 %A A013793 _N. J. A. Sloane_