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 A050696 #14 Oct 15 2019 01:40:00
%S A050696 12,15,20,22,24,25,26,28,30,32,33,35,36,39,42,45,50,52,55,62,63,65,70,
%T A050696 72,75,77,82,85,92,93,95,102,105,110,112,115,120,122,123,124,125,126,
%U A050696 128,130,132,135,138,142,145,147,150,152,153,155,162,165,170,172,175
%N A050696 At least one prime factor of composite a(n) is a substring of a(n).
%H A050696 Vincenzo Librandi, <a href="/A050696/b050696.txt">Table of n, a(n) for n = 1..4720</a>
%e A050696 26 is in the sequence because 26 = 2 * 13 and the factor 2 appears in the decimal representation. Though 13 does not appear, the 2 is enough for 26 to be in the sequence.
%e A050696 27 is not in the sequence since 27 = 3 * 3 * 3, which does not appear in the decimal representation.
%t A050696 digs[n_] := IntegerDigits[n]; A050696 = {}; Do[le1 = Max@@Length/@(prFDigs = digs[First/@FactorInteger[n]]); dSubStrs = Flatten[Table[Partition[digs[n], i, 1], {i, le1}], 1]; If[!PrimeQ[n] && Intersection[prFDigs, dSubStrs] != {}, AppendTo[A050696, n]],{n, 2, 180}]; A050696 (* _Jayanta Basu_, May 31 2013 *)
%Y A050696 Cf. A050694, A050695.
%K A050696 nonn,base
%O A050696 1,1
%A A050696 _Patrick De Geest_, Aug 15 1999