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 A206288 #11 Mar 13 2019 13:05:29
%S A206288 1,121,143,169,187,1111,1133,1177,1199,1243,1313,1331,1339,1391,1397,
%T A206288 1417,1441,1469,1507,1529,1573,1639,1651,1661,1703,1717,1727,1751,
%U A206288 1781,1793,1807,1819,1837,1853,1859,1903,1919,1921,1937,1957,1963,1969,1991
%N A206288 Nonprime numbers with all divisors starting with digit 1.
%C A206288 Subsequence of A206286, A131835.
%C A206288 Complement of A045707 (primes with first digit 1) with respect to A202287 (numbers with all divisors starting with digit 1).
%H A206288 Robert Israel, <a href="/A206288/b206288.txt">Table of n, a(n) for n = 1..10000</a>
%e A206288 All divisors of 1859 (1, 11, 13, 169, 1859) start with digit 1.
%p A206288 fd1:= n -> n < 2*10^ilog10(n):
%p A206288 filter:= proc(n) not isprime(n) and andmap(fd1,numtheory:-divisors(n)) end proc:
%p A206288 select(filter, [1,seq(seq(i,i=10^d+1..2*10^d-1,2),d=1..3)]); # _Robert Israel_, Mar 13 2019
%t A206288 fQ[n_] := Module[{d = Divisors[n]}, Union[IntegerDigits[#][[1]] & /@ d] == {1}]; Select[Range[1991], ! PrimeQ[#] && fQ[#] &] (* _T. D. Noe_, Feb 13 2012 *)
%Y A206288 Cf. A045707 (primes with first digit 1), A202287 (numbers with all divisors starting with digit 1).
%K A206288 nonn,base
%O A206288 1,2
%A A206288 _Jaroslav Krizek_, Feb 12 2012