The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061587 a(1) = 1, a(n)= number obtained by replacing each digit of a(n-1) with nine times its value. 16
 1, 9, 81, 729, 631881, 5427972729, 45361863816318631881, 36452754972542772954279725427972729, 2754364518634536816318453618636318814536186381631845361863816318631881 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Each of the subsequences a(9n), a(9n-1), ..., and a(9n-8) converges to a different limit, if we consider the numbers as sequences of digits. - M. F. Hasler, Jun 24 2016 LINKS Indranil Ghosh, Table of n, a(n) for n = 1..13 PROG (PARI) A061587(n=2, a=1, m=9)={while(n--, a=eval(concat(apply(t->Str(t), digits(a)*m)))); a} \\ If only the 2nd argument is given, then the operation is applied once to that argument. - M. F. Hasler, Jun 24 2016 CROSSREFS Cf. A061581 - A061586, A061511-A061522, A061746-A061750. Sequence in context: A240945 A158779 A047901 * A033145 A158762 A101601 Adjacent sequences:  A061584 A061585 A061586 * A061588 A061589 A061590 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, May 13 2001 EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org) and Asher Natan Auel (auela(AT)reed.edu), May 15 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 9 15:34 EDT 2021. Contains 343742 sequences. (Running on oeis4.)