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 A367354 #12 Nov 18 2023 11:55:30 %S A367354 10,11,23,58,139,231,243,275,328,412,436,501,516,581,596,662,688,775, %T A367354 833,871,889,988,1069,1160,1161,1172,1193,1224,1265,1316,1377,1448, %U A367354 1529,1620,1621,1632,1653,1684,1725,1776,1837,1908,1989,2081,2093,2125,2177,2249,2341,2353 %N A367354 Analog of A121805, but starting with 10. %C A367354 Contains 20573 terms, the last of which is 999936. %H A367354 Michael De Vlieger, <a href="/A367354/b367354.txt">Table of n, a(n) for n = 1..20573</a> %t A367354 a[1] = b = 10; m = b - 1; 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, 50] (* _Michael De Vlieger_, Nov 18 2023, after _Jean-François Alcover_ at A121805 *) %o A367354 (Python) %o A367354 from itertools import islice %o A367354 def agen(start=10): # generator of terms %o A367354 an, y = start, 1 %o A367354 while y < 10: %o A367354 yield an %o A367354 an, y = an + 10*(an%10), 1 %o A367354 while y < 10: %o A367354 if str(an+y)[0] == str(y): %o A367354 an += y %o A367354 break %o A367354 y += 1 %o A367354 print(list(islice(agen(), 50))) # _Michael S. Branicky_, Nov 18 2023 %Y A367354 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 A367354 Cf. A330128, A330129. %K A367354 nonn,fini,base %O A367354 1,1 %A A367354 _N. J. A. Sloane_, Nov 17 2023