|
Search: id:A001019
|
|
|
| A001019 |
|
Powers of 9.
(Formerly M4653 N1992)
|
|
+0
21
|
|
| 1, 9, 81, 729, 6561, 59049, 531441, 4782969, 43046721, 387420489, 3486784401, 31381059609, 282429536481, 2541865828329, 22876792454961, 205891132094649, 1853020188851841, 16677181699666569, 150094635296999121, 1350851717672992089
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Same as Pisot sequences E(1,9), L(1,9), P(1,9), T(1,9). See A008776 for definitions of Pisot sequences.
Except for 1, the largest n-th power with n digits. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 09 2002
A000005(a(n)) = A005408(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2007
|
|
LINKS
|
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 274
Tanya Khovanova, Recursive Sequences
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
|
|
FORMULA
|
a(n) = 9^n; a(n) = 9a(n-1).
G.f.: 1/(1-9x), e.g.f.: exp(9x)
|
|
CROSSREFS
|
Cf. A067470.
Adjacent sequences: A001016 A001017 A001018 this_sequence A001020 A001021 A001022
Sequence in context: A120997 A125630 A100062 this_sequence A074118 A050739 A047901
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.003 seconds
|
