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 A215142 #11 Aug 28 2013 17:04:56
%S A215142 6,12,18,24,36,48,54,72,96,108,144,162,192,216,231,288,324,330,384,
%T A215142 432,455,486,546,576,648,660,663,693,768,864,935,972,990,1092,1122,
%U A215142 1152,1235,1296,1311,1320,1458,1463,1482,1536,1617,1638,1650,1728,1944,1955
%N A215142 Numbers n such that the difference between the greatest prime divisor of n and the sum of the other distinct prime divisors equals 1.
%C A215142 A033845 is included in this sequence.
%H A215142 Harvey P. Dale, <a href="/A215142/b215142.txt">Table of n, a(n) for n = 1..1000</a>
%e A215142 1235 is in the sequence because 1235 = 5*13*19 and 19 - (5+13) = 1.
%p A215142 with(numtheory):for n from 2 to 2000 do:x:=factorset(n):m:=nops(x):s:=0: s:=sum( '
%p A215142 x[i] ', 'i'=1..m):q:=s-x[m]:if x[m]-q =1 then printf(`%d, `,n):else fi:od:
%t A215142 gpdQ[n_]:=Module[{f=Transpose[FactorInteger[n]][[1]]},Max[f]-Total[ Most[ f]] == 1]; Select[Range[2,2000],gpdQ] (* _Harvey P. Dale_, Aug 28 2013 *)
%Y A215142 Cf. A033845.
%K A215142 nonn
%O A215142 1,1
%A A215142 _Michel Lagneau_, Aug 04 2012