|
%I #24 Apr 05 2023 22:23:01
%S 1,112,139,219,373,719,1133,1919,3377,17117
%N a(n) is the smallest k such that A361338(k) = n.
%e a(n) n {the digits reached}
%e 1 1 {1}
%e 112 2 {2, 4}
%e 139 3 {8, 4, 7}
%e 219 4 {8, 2, 4, 6}
%e 373 5 {1, 2, 4, 6, 8}
%e 719 6 {0, 2, 4, 6, 8, 9}
%e 1133 7 {0, 2, 4, 6, 7, 8, 9}
%e 1919 8 {0, 2, 4, 5, 6, 7, 8, 9}
%e 3377 9 {0, 2, 3, 4, 5, 6, 7, 8, 9}
%e 17117 10 {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
%t With[{s = Import["https://oeis.org/A361338/b361338.txt", "Data"][[All, -1]]}, {1}~Join~Table[-1 + FirstPosition[s, k][[1]], {k, 2, 10}]] (* _Michael De Vlieger_, Apr 04 2023, using bfile at A361338 *)
%o (Python)
%o from itertools import count
%o def agen():
%o n, adict = 1, dict()
%o for k in count(1):
%o v = A361338(k) # uses A361338() and reach1() in A361338
%o if v not in adict: adict[v] = k
%o while n in adict: yield adict[n]; n += 1
%o if n == 11: return
%o print(list(agen())) # _Michael S. Branicky_, Apr 04 2023
%Y Cf. A361337-A361349.
%K nonn,base,fini,full
%O 1,2
%A _N. J. A. Sloane_, Apr 04 2023, based on an email from _Michael S. Branicky_
|
