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 A059043 #12 May 26 2022 08:37:01 %S A059043 0,1,2,3,4,5,6,7,8,9,12,23,34,45,56,67,78,89,90,123,234,345,456,567, %T A059043 678,789,890,901,1234,2345,3456,4567,5678,6789,7890,8901,9012,12345, %U A059043 23456,34567,45678,56789,67890,78901,89012,90123,123456,234567,345678,456789 %N A059043 Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9. %C A059043 Numbers that are contiguous substrings of those in A062273. - _Michael S. Branicky_, May 26 2022 %H A059043 Michael S. Branicky, <a href="/A059043/b059043.txt">Table of n, a(n) for n = 1..9001</a> %o A059043 (Python) %o A059043 def ok(n): %o A059043 s = str(n) %o A059043 return s == "".join(str((int(s[0])+i)%10) for i in range(len(s))) %o A059043 print([k for k in range(10**6) if ok(k)]) # _Michael S. Branicky_, May 26 2022 %o A059043 (Python) %o A059043 from itertools import count, islice %o A059043 def agen(): # generator of terms %o A059043 yield 0 %o A059043 for d in count(1): %o A059043 for s0 in range(1, 10): %o A059043 yield int("".join(str((s0+i)%10) for i in range(d))) %o A059043 print(list(islice(agen(), 50))) # _Michael S. Branicky_, May 26 2022 %Y A059043 Cf. A161760, A006055, A062273. %K A059043 easy,nonn,base %O A059043 1,3 %A A059043 Thomas Schulze (jazariel(AT)tiscalenet.it), Feb 12 2001 %E A059043 More terms from Brian DiCesare (bdicesar(AT)ashland.edu), Oct 11 2004 %E A059043 a(1) = 0 inserted by _Michael S. Branicky_, May 26 2022