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.
from itertools import count
def b(n):
if n in [0, 2, 4, 8] or n % 10 == 0: return -1
for k in count(1):
if str(k) in str(k*n): return k
a, n, max = [], 0, -2
while len(a) < 10:
if (m := b(n)) > max:
a.append(n)
max = m
n += 1
print(a)
44*1 = 44 does not have 1 as a substring. 44*2 = 88 does not have 2 as a substring. 44*3 = 132 has 3 as a substring. So, a(44) = 132.
from itertools import count
def a(n):
if n in [0, 2, 4, 8]: return -1
if n % 10 == 0: return -1 if (k:=a(n//10)) == -1 else 10*k
for k in count(1):
if str(k) in str(k*n): return k*n
print([a(n) for n in range(100)])