|
Search: id:A011557
|
|
| |
|
| 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000, 100000000000, 1000000000000, 10000000000000, 100000000000000, 1000000000000000, 10000000000000000, 100000000000000000, 1000000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Same as Pisot sequences E(1,10), L(1,10), P(1,10), T(1,10). See A008776 for definitions of Pisot sequences.
With a leading zero, this is (10^n-0^n)/10, with e.g.f. exp(5x)sinh(5x)/5. This is the binomial transform of A015577. - Paul Barry (pbarry(AT)wit.ie), Jul 09 2003
A000005(a(n)) = A000290(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2007
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
a(n) = 10^n; a(n) = 10*a(n-1).
G.f.: 1/(1-10x), e.g.f.: exp(10x)
|
|
CROSSREFS
|
Adjacent sequences: A011554 A011555 A011556 this_sequence A011558 A011559 A011560
Sequence in context: A086067 A136873 A135655 this_sequence A138825 A138824 A138823
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
