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 A067598 #9 Aug 17 2016 05:24:22
%S A067598 21,36,8277,22987,31199,59577,2092101,25224589,29963201,564423629,
%T A067598 1353149983,30011570617,37090609821,392629311959
%N A067598 Decimal encoding of the prime factorization of n is a multiple of n.
%C A067598 If n = p_1^e_1 * ... * p_r^e_r with p_1 < ... < p_r, then the decimal encoding is p_1 e_1...p_r e_r. For example, 15 = 3^1 * 5^1, so has decimal encoding 3151.
%C A067598 a(12) > 10^10. [From _Donovan Johnson_, Mar 26 2010]
%C A067598 a(15) > 10^12. - _Giovanni Resta_, Aug 17 2016
%e A067598 The prime factorization of 21 = 3^1 * 7^1 with corresponding encoding 3171. 3171 = 21 * 151, a multiple of 21. So 21 is a term of the sequence.
%t A067598 Select[Range[100000], Mod[FromDigits[Flatten[IntegerDigits /@ Flatten[FactorInteger[ # ]]]], # ] ==0 &]
%o A067598 (PARI) {a067598(a,b) = local(n,v); for(n=max(2,a),b,v=factor(n); if(eval(concat(vector(matsize(v)[1],k,concat(vector(matsize(v)[2],j,Str(v[k,j]))))))%n==0,print1(n,",")))}
%K A067598 base,easy,nonn
%O A067598 1,1
%A A067598 _Joseph L. Pe_, Jan 31 2002
%E A067598 Edited and extended by _Robert G. Wilson v_, Feb 02 2002
%E A067598 Two more terms from _Klaus Brockhaus_, Feb 20 2002
%E A067598 a(10)-a(11) from _Donovan Johnson_, Mar 26 2010
%E A067598 a(12)-a(14) from _Giovanni Resta_, Aug 17 2016