Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #22 Sep 08 2022 08:44:38
%S 10,10000,10000000,10000000000,10000000000000,10000000000000000,
%T 10000000000000000000,10000000000000000000000,
%U 10000000000000000000000000,10000000000000000000000000000
%N a(n) = 10^(3*n + 1).
%H Vincenzo Librandi, <a href="/A013746/b013746.txt">Table of n, a(n) for n = 0..100</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1000).
%F From _Philippe Deléham_, Nov 30 2008: (Start)
%F a(n) = 1000*a(n-1); a(0)=10.
%F G.f.: 10/(1-1000*x). (End)
%t 10^(3Range[0,10]+1) (* _Harvey P. Dale_, Mar 28 2011 *)
%o (Magma) [10^(3*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011
%o (PARI) a(n)=10^(3*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_