The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A013747 a(n) = 10^(3*n + 2). 1
100, 100000, 100000000, 100000000000, 100000000000000, 100000000000000000, 100000000000000000000, 100000000000000000000000, 100000000000000000000000000, 100000000000000000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
From Philippe Deléham, Nov 30 2008: (Start)
a(n) = 1000*a(n-1); a(0)=100.
G.f.: 100/(1-1000*x).
a(n) = 10*A013746(n). (End)
PROG
(Magma) [10^(3*n+2): n in [0..15]]; // Vincenzo Librandi, Jun 26 2011
(PARI) a(n)=10^(3*n+2) \\ Charles R Greathouse IV, Jul 10 2016
CROSSREFS
Subsequence of A011557 (10^n).
Sequence in context: A267885 A307810 A151648 * A065447 A036507 A369405
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 June 12 18:11 EDT 2024. Contains 373359 sequences. (Running on oeis4.)