|
|
A367350
|
|
Analog of A121805, but starting with 6.
|
|
9
|
|
|
6, 73, 104, 145, 196, 258, 341, 354, 397, 471, 485, 540, 545, 601, 617, 693, 730, 737, 815, 873, 912, 941, 960, 969, 1060, 1061, 1072, 1093, 1124, 1165, 1216, 1277, 1348, 1429, 1520, 1521, 1532, 1553, 1584, 1625, 1676, 1737, 1808, 1889, 1980, 1981, 1992, 2014, 2056, 2118
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Contains 209534289952018960 terms, the last term being a(209534289952018960) = 9999999999999999936.
|
|
LINKS
|
|
|
MATHEMATICA
|
b = 10; m = b - 1; a[1] = 6; 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 *)
|
|
PROG
|
(Python)
from itertools import count, islice
def agen(start=6): # 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,base,fini
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|