A013747 a(n) = 10^(3*n + 2).

100, 100000, 100000000, 100000000000, 100000000000000, 100000000000000000, 100000000000000000000, 100000000000000000000000, 100000000000000000000000000, 100000000000000000000000000000, 100000000000000000000000000000000, 100000000000000000000000000000000000

Offset

0,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..100

Tanya Khovanova, Recursive Sequences.

Index entries for linear recurrences with constant coefficients, signature (1000).

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)

From Elmo R. Oliveira, Jul 07 2025: (Start)

E.g.f.: 100*exp(1000*x).

a(n) = A013731(n)*A013737(n) = A011557(A016789(n)). (End)

Mathematica

10^(3*Range[0, 15] + 2) (* Paolo Xausa, May 29 2026 *)

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).

Cf. A013731, A013737, A013746, A016789.

Sequence in context: A307810 A394861 A151648 * A065447 A036507 A369405

Adjacent sequences: A013744 A013745 A013746 * A013748 A013749 A013750

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved