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 A063172 #5 Apr 28 2015 16:53:20
%S A063172 1387,1849,2117,4307,8299,34547,35947,38491,68753,69679,84281,90637,
%T A063172 128729,183097,185047,230689,281443,407837,423979,483029,664457,
%U A063172 719399,904537,1056403,1121213,1236511,1247707,1303391,1308947,1369751
%N A063172 Composite numbers which in base 9 contain their largest proper factor as a substring.
%t A063172 Do[ If[ !PrimeQ[ n ] && StringPosition[ ToString[ FromDigits[ IntegerDigits[ n, 9 ] ] ], ToString[ FromDigits[ IntegerDigits[ Divisors[ n ] [ [ -2 ] ], 9 ] ] ] ] != {}, Print[ n ] ], {n, 2, 2*10^6} ]
%t A063172 lpf9Q[n_]:=Module[{idn9=IntegerDigits[n,9],d9=IntegerDigits[ Divisors[ n][[-2]],9]},d9!={1}&&SequenceCount[idn9,d9]>0]; Select[Range[ 2, 1500000], lpf9Q] (* The program uses the SequenceCount function from Mathematica version 10 *) (* _Harvey P. Dale_, Apr 28 2015 *)
%Y A063172 Cf. A062238.
%K A063172 base,nonn
%O A063172 1,1
%A A063172 _Robert G. Wilson v_, Aug 08 2001