cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A061511 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.

This page as a plain text file.
%I A061511 #14 Feb 10 2017 02:36:12
%S A061511 0,1,2,3,4,5,6,7,8,9,10,21,32,43,54,65,76,87,98,109,2110,3221,4332,
%T A061511 5443,6554,7665,8776,9887,10998,2110109,32212110,43323221,54434332,
%U A061511 65545443,76656554,87767665,98878776,109989887,211010910998
%N A061511 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.
%C A061511 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.
%C A061511 a(n+10) is the concatenation of a(n) and a(n-1).
%C A061511 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
%H A061511 Indranil Ghosh, <a href="/A061511/b061511.txt">Table of n, a(n) for n = 0..97</a>
%e A061511 Following 43: 4+1 = 5 and 3+1 = 4, hence the next term is 54.
%t A061511 NestList[FromDigits[Flatten[IntegerDigits[IntegerDigits[#]+1]]]&,0,38] (* _Jayanta Basu_, May 18 2013 *)
%o A061511 (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
%Y A061511 Cf. A061512 - A061522, A061746 - A061750; A061581 - A061587.
%K A061511 base,nonn
%O A061511 0,3
%A A061511 _Amarnath Murthy_, May 08 2001