|
|
A367354
|
|
Analog of A121805, but starting with 10.
|
|
9
|
|
|
10, 11, 23, 58, 139, 231, 243, 275, 328, 412, 436, 501, 516, 581, 596, 662, 688, 775, 833, 871, 889, 988, 1069, 1160, 1161, 1172, 1193, 1224, 1265, 1316, 1377, 1448, 1529, 1620, 1621, 1632, 1653, 1684, 1725, 1776, 1837, 1908, 1989, 2081, 2093, 2125, 2177, 2249, 2341, 2353
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Contains 20573 terms, the last of which is 999936.
|
|
LINKS
|
|
|
MATHEMATICA
|
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 *)
|
|
PROG
|
(Python)
from itertools import islice
def agen(start=10): # generator of terms
an, y = start, 1
while y < 10:
yield an
an, y = an + 10*(an%10), 1
while y < 10:
if str(an+y)[0] == str(y):
an += y
break
y += 1
|
|
CROSSREFS
|
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.
|
|
KEYWORD
|
nonn,fini,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|