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.
%I A061518 #9 Mar 20 2022 04:13:53
%S A061518 0,5,10,65,1110,6665,11111110,66666665,1111111111111110,
%T A061518 6666666666666665,11111111111111111111111111111110,
%U A061518 66666666666666666666666666666665,1111111111111111111111111111111111111111111111111111111111111110
%N A061518 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 5.
%C A061518 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.
%o A061518 (Python)
%o A061518 from itertools import accumulate, repeat
%o A061518 def f(n, _): return int("".join(str(int(d)+5) for d in str(n)))
%o A061518 def aupton(nn): return list(accumulate(repeat(0, nn+1), f))
%o A061518 print(aupton(12)) # _Michael S. Branicky_, Mar 19 2022
%K A061518 base,nonn
%O A061518 0,2
%A A061518 _Amarnath Murthy_, May 08 2001
%E A061518 More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
%E A061518 a(3) and following corrected and formula removed by _Georg Fischer_, Mar 19 2022