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 A367352 #13 Nov 18 2023 11:55:10 %S A367352 8,97,168,250,252,274,317,390,393,427,502,527,603,639,736,804,852,880, %T A367352 888,977,1048,1129,1220,1221,1232,1253,1284,1325,1376,1437,1508,1589, %U A367352 1680,1681,1692,1713,1744,1785,1836,1897,1968,2050,2052,2074,2116,2178,2260,2262,2284 %N A367352 Analog of A121805, but starting with 8. %C A367352 Contains 198104936410 terms, the last being 9999999999972. %H A367352 Michael De Vlieger, <a href="/A367352/b367352.txt">Table of n, a(n) for n = 1..10000</a> %t A367352 b = 10; m = b - 1; a[1] = 8; a[n_] := a[n] = For[r = Mod[a[n - 1], b]; y = 0, y <= m, y++, If[y == IntegerDigits[#, b][[1]], Return[#]] &[a[n - 1] + b r + y]]; Array[a, 45] (* _Michael De Vlieger_, Nov 18 2023, after _Jean-François Alcover_ at A121805 *) %o A367352 (Python) %o A367352 from itertools import islice %o A367352 def agen(start=8): # generator of terms %o A367352 an, y = start, 1 %o A367352 while y < 10: %o A367352 yield an %o A367352 an, y = an + 10*(an%10), 1 %o A367352 while y < 10: %o A367352 if str(an+y)[0] == str(y): %o A367352 an += y %o A367352 break %o A367352 y += 1 %o A367352 print(list(islice(agen(), 50))) # _Michael S. Branicky_, Nov 18 2023 %Y A367352 Comma sequences in base 10, starting with 1, 2, 4, 5, 6, 7, 8, 9, 10 are A121805, A139284, A366492, A367337, A367350, A367351, A367352, A367353, A367354. Starting with 3 is trivial, and those starting with 11, 12, 13 are essentially duplicates. %Y A367352 Cf. A330128, A330129. %K A367352 nonn,fini,base %O A367352 1,1 %A A367352 _N. J. A. Sloane_, Nov 17 2023