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”).

A061511
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.
21
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 21, 32, 43, 54, 65, 76, 87, 98, 109, 2110, 3221, 4332, 5443, 6554, 7665, 8776, 9887, 10998, 2110109, 32212110, 43323221, 54434332, 65545443, 76656554, 87767665, 98878776, 109989887, 211010910998
OFFSET
0,3
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.
a(n+10) is the concatenation of a(n) and a(n-1).
Considering each term as a sequence of digits, each of the subsequences a(9n), a(9n-1), ... and a(9n-8) converges to a different limit. - M. F. Hasler, Jun 24 2016
LINKS
EXAMPLE
Following 43: 4+1 = 5 and 3+1 = 4, hence the next term is 54.
MATHEMATICA
NestList[FromDigits[Flatten[IntegerDigits[IntegerDigits[#]+1]]]&, 0, 38] (* Jayanta Basu, May 18 2013 *)
PROG
(PARI) A061511(n=2, a=n>0, m=1)={for(n=2, 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
STATUS
approved