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 A221698 #20 Jan 31 2013 03:18:04
%S A221698 22,121,202,1111,2222,10201,12221,20222,22121,111221,112211,202222,
%T A221698 220121,221111,222211,1021211,1112221,1122011,1222201,2021111,2022002,
%U A221698 2022121,2121101,2122111,2200202,2202211,2211121,2212111,2222011,10212211,11112211,11121011
%N A221698 Composite numbers n such that largest digit of all divisors of n is 2.
%C A221698 Also composite numbers n such that largest digit of concatenation of all divisors (A037278) of n is 2.
%C A221698 Composite numbers n such that A209928(n) = 2.
%C A221698 Complement of A106100 with respect to A221697.
%e A221698 Number 10201 is in the sequence because the largest digit of all divisors of 10201 (1, 101, 10201) is 2.
%t A221698 t = {}; n = 1; While[Length[t] < 40, n++; m = FromDigits[IntegerDigits[n, 3]]; If[! PrimeQ[m] && Max[Union[Flatten[IntegerDigits[Divisors[m]]]]] <= 2, AppendTo[t, m]]]; t (* _T. D. Noe_, Jan 30 2013 *)
%Y A221698 Cf. A209928 (largest digit of all divisors of n), A221697.
%K A221698 nonn,base
%O A221698 1,1
%A A221698 _Jaroslav Krizek_, Jan 22 2013