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 A139138 #33 Nov 12 2021 10:20:14
%S A139138 11,12,15,22,24,33,36,44,48,55,66,77,88,99,101,102,104,105,110,111,
%T A139138 112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,128,131,
%U A139138 132,135,138,140,141,142,144,145,147,148,150,151,152,153,155,156,161,162
%N A139138 Numbers divisible by at least two of their digits.
%C A139138 Digits need not be distinct. This may be considered row 2 of an infinite array whose 1st row is A038770. Each such row is a subset of the ones above it.
%H A139138 Amiram Eldar, <a href="/A139138/b139138.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..100 from Alvin Hoover Belt)
%H A139138 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>
%t A139138 fQ[n_] := Count[Mod[n, Flatten[IntegerDigits[n] /. {0 -> {}}]], 0] > 1; Select[ Range@ 170, fQ] (* _Robert G. Wilson v_, Jun 23 2014 *)
%t A139138 Select[Range[200],Count[Divisible[#,Select[IntegerDigits[#], #>0&]], True]>1&] (* _Harvey P. Dale_, Dec 16 2015 *)
%o A139138 (Python)
%o A139138 from sympy import factorint
%o A139138 def ok(n): return sum(1 for d in map(int, str(n)) if d > 0 and n%d == 0) > 1
%o A139138 print([k for k in range(163) if ok(k)]) # _Michael S. Branicky_, Nov 12 2021
%Y A139138 Cf. A038770, A187516.
%K A139138 base,easy,nonn,dumb
%O A139138 1,1
%A A139138 _Jonathan Vos Post_, Jun 05 2008
%E A139138 More terms from _Alvin Hoover Belt_, Apr 06 2009
%E A139138 Own omission (140) fixed by _Alvin Hoover Belt_, Apr 18 2009