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.
%I A116443 #16 Mar 26 2023 16:04:08
%S A116443 1,2,4,8,11,13,14,22,26,28,44,52,56,77,88,91,137,146,274,292,548,584,
%T A116443 9091,19802,39604,79208,909091,5882353,10989011,12987013,13986014,
%U A116443 15037594,16194332,19138756,21978022,25974026,27972028,30075188,32388664,38277512,43956044
%N A116443 Numbers k which when sandwiched between two 8's give a multiple of k.
%H A116443 Michael S. Branicky, <a href="/A116443/b116443.txt">Table of n, a(n) for n = 1..6504</a>
%e A116443 91 belongs since 8918 is a multiple of 91 (91*98 = 8918).
%t A116443 f[k_, d_] := Flatten@Table[Select[Divisors[k*(10^(i + 1) + 1)], IntegerLength[ # ] == i &], {i, d}]; f[8, 8] f[k_, d_] := Flatten@Table[Select[Divisors[k*(10^(i + 1) + 1)], IntegerLength[ # ] == i &], {i, d}]; f[9, 8] (* _Ray Chandler_, May 11 2007 *)
%t A116443 Select[Range[301*10^5],Divisible[FromDigits[Join[{8},IntegerDigits[#],{8}]],#]&] (* _Harvey P. Dale_, Aug 27 2019 *)
%o A116443 (Python)
%o A116443 from sympy import isprime
%o A116443 from itertools import count, islice
%o A116443 def agen(): # generator of terms
%o A116443 yield from [1, 2, 4, 8]
%o A116443 for k in count(2):
%o A116443 t = 8*(10**(k+1) + 1)
%o A116443 yield from (t//i for i in range(800, 80, -1) if t%i == 0)
%o A116443 print(list(islice(agen(), 41))) # _Michael S. Branicky_, Mar 26 2023
%Y A116443 Cf. A116436, A116437, A116438, A116439, A116440, A116441, A116442, A116444.
%K A116443 base,nonn
%O A116443 1,2
%A A116443 _Giovanni Resta_, Feb 15 2006
%E A116443 a(39) and beyond from _Michael S. Branicky_, Mar 26 2023