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 A062649 #17 Nov 08 2019 03:18:23
%S A062649 121,143,169,187,221,341,361,451,671,781,961,1037,1111,1133,1159,1177,
%T A062649 1199,1207,1243,1271,1313,1331,1339,1349,1391,1397,1417,1441,1469,
%U A062649 1507,1529,1573,1639,1651,1661,1681,1703,1717,1727,1751,1781,1793,1807,1819
%N A062649 Composite numbers with property that every divisor contains the digit 1.
%C A062649 Intersection of A002808 and A062634. - _Michel Marcus_, Sep 12 2013
%H A062649 Amiram Eldar, <a href="/A062649/b062649.txt">Table of n, a(n) for n = 1..10000</a>
%e A062649 143 has divisors 1, 11, 13 and 143, all of which contain the digit 1.
%t A062649 fQ[n_, dgt_] := Union[ MemberQ[#, dgt] & /@ IntegerDigits@ Rest@ Divisors@ n][[1]]; Select[ Range[2, 1850], !PrimeQ[#] && fQ[#, 1] &] (* _Robert G. Wilson v_, Jun 11 2014 *)
%o A062649 (PARI) lista(nn) = {forcomposite(n = 1, nn, ok = 1; fordiv(n, d, ok = ok && setsearch(Set(digits(d)), 1)); if (ok, print1(n, ", ")););} \\ _Michel Marcus_, Sep 12 2013
%Y A062649 Cf. A062634, A062653, A062664, A062667, A062669, A062670, A062671, A062672, A062673, A062674, A062675, A062676, A062677, A062678, A062679, A062680.
%K A062649 base,easy,nonn
%O A062649 1,1
%A A062649 _Erich Friedman_, Jul 04 2001