OFFSET
1,2
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..8367
EXAMPLE
See A367344 for the calculation of the first three terms.
MATHEMATICA
b = 8; a[1] = 1; a[n_] := a[n] = For[x = Mod[a[n - 1], b]; y = 0, y <= (b - 1), y++, k = a[n - 1] + b*x + y; If[y == IntegerDigits[k, b][[1]], Return[k]]]; Array[a, 10^4] (* Michael De Vlieger, Nov 15 2023, after Jean-François Alcover at A121805 *)
PROG
(Python)
from itertools import islice
from sympy.ntheory.factor_ import digits
def agen(): # generator of terms
an, y = 1, 1
while y < 8:
yield an
an, y = an + 8*(an%8), 1
while y < 8:
if str(digits(an+y, 8)[1]) == str(y):
an += y
break
y += 1
print(list(islice(agen(), 52))) # Michael S. Branicky, Nov 16 2023
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
N. J. A. Sloane, Nov 15 2023
STATUS
approved