login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A061749
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 9.
2
1, 10, 109, 10918, 109181017, 1091810171091016, 1091810171091016109181091015, 1091810171091016109181091015109181017109181091014
OFFSET
0,2
COMMENTS
In A061511-A061522, A061746-A061750 when the incremented digit exceeds 9 it is written as a 2-digit string. So 9+1 becomes the 2-digit string 10, etc.
Considering each term as a sequence of digits, this sequence converges to the same limit as A061750, 109181017109101610918109..., fixed point of the operation. - M. F. Hasler, Jun 24 2016
PROG
(PARI) A061749(n=1, a=1, m=9)={for(n=1, n, a=eval(concat(apply(t->Str(t+m), digits(a))))); a} \\ If only the 2nd argument is given, then the operation is applied once to that argument. - M. F. Hasler, Jun 24 2016
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, May 08 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
STATUS
approved