A098608 a(n) = 100^n.

1, 100, 10000, 1000000, 100000000, 10000000000, 1000000000000, 100000000000000, 10000000000000000, 1000000000000000000, 100000000000000000000, 10000000000000000000000, 1000000000000000000000000, 100000000000000000000000000, 10000000000000000000000000000, 1000000000000000000000000000000

Offset

0,2

Comments

For any base B, these are the numbers (B^2)^n written in base B. - Philippe Deléham, Jan 06 2008

References

S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

Links

Table of n, a(n) for n=0..15.

Tanya Khovanova, Recursive Sequences.

Robert Price, Comments on A098608 concerning Elementary Cellular Automata, Feb 20 2016.

S. Wolfram, A New Kind of Science

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

Index to Elementary Cellular Automata

Index entries for sequences related to cellular automata

Formula

a(n) = 100*a(n-1) = A011557(2n) = A098609(n) + 1.

G.f.: 1/(1-100x).

E.g.f.: exp(100*x). - Stefano Spezia, Aug 05 2024

Mathematica

LinearRecurrence[{100}, {1}, 12] (* Ray Chandler, Aug 17 2015 *)
NestList[100#&, 1, 20] (* Harvey P. Dale, Dec 28 2018 *)

Crossrefs

Cf. A011557, A098609.

Sequence in context: A181412 A029794 A029801 * A045799 A096885 A267449

Adjacent sequences: A098605 A098606 A098607 * A098609 A098610 A098611

Keyword

easy,nonn

Author

Henry Bottomley, Sep 17 2004

Extensions

a(12)-a(15) from Stefano Spezia, Aug 05 2024

Status

approved