login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013855 a(n) = 10^(5*n + 2). 1

%I #13 Sep 08 2022 08:44:38

%S 100,10000000,1000000000000,100000000000000000,

%T 10000000000000000000000,1000000000000000000000000000,

%U 100000000000000000000000000000000,10000000000000000000000000000000000000,1000000000000000000000000000000000000000000

%N a(n) = 10^(5*n + 2).

%H Vincenzo Librandi, <a href="/A013855/b013855.txt">Table of n, a(n) for n = 0..50</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 (100000).

%o (Magma) [10^(5*n+2): n in [0..10]]; // _Vincenzo Librandi_, Jul 08 2011

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)