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 A143957 #12 Nov 05 2020 05:36:28
%S A143957 6,12,14,15,18,20,24,35,36,39,44,45,48,50,54,63,72,75,80,84,96,108,
%T A143957 119,135,143,144,147,152,153,155,162,175,192,200,208,216,224,225,230,
%U A143957 231,242,245,275,279,288,294,299,315,320,323,324,374,375,384,399,405,429
%N A143957 An integer >= 2 is included if {the difference between the largest and smallest primes dividing n} divides n+1.
%H A143957 Robert Israel, <a href="/A143957/b143957.txt">Table of n, a(n) for n = 1..10000</a>
%e A143957 The largest prime dividing 14 is 7. The smallest prime dividing 14 is 2. 7-2=5 divides 14+1=15. So 14 is in the sequence.
%p A143957 filter:= proc(n) local P;
%p A143957 P:= numtheory:-factorset(n);
%p A143957 if nops(P) = 1 then return false fi;
%p A143957 n+1 mod (max(P)-min(P)) = 0
%p A143957 end proc:
%p A143957 select(filter, [$2..1000]); # _Robert Israel_, Nov 04 2020
%t A143957 Select[Range[2, 429], If[Or[PrimeQ[#], PrimePowerQ[#]], False, Mod[#1, Last[#2] - First[#2]] == 0 & @@ {# + 1, FactorInteger[#][[All, 1]]}] &] (* _Michael De Vlieger_, Nov 04 2020 *)
%Y A143957 Cf. A143958. Includes A037074.
%K A143957 nonn
%O A143957 1,1
%A A143957 _Leroy Quet_, Sep 05 2008
%E A143957 Extended by _Ray Chandler_, Nov 07 2008