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 A029562 #18 May 21 2013 11:09:24
%S A029562 598,3913,11590,32578,91078,95170,154843,179998,301273,317623,668743,
%T A029562 1742830,1806673,2486482,2517226,4543423,5013853,5237230,6360523,
%U A029562 6704773,7342162,8810503,10775833,12858118,16650478,18183823,19230433,21381358
%N A029562 Quasi-Carmichael numbers to base -2: squarefree composites n such that for every prime p that divides n, p+2 divides n+2.
%H A029562 Donovan Johnson and Giovanni Resta, <a href="/A029562/b029562.txt">Table of n, a(n) for n = 1..600</a> (terms < 10^12, first 200 terms from Donovan Johnson)
%H A029562 <a href="/index/Ca#Carmichael">Index entries for sequences related to Carmichael numbers.</a>
%t A029562 qcp[n_, d_] := Block[{p, e}, {p, e} = Transpose@FactorInteger@n;
%t A029562 Length[p] > 1 && Max[e] == 1 && And @@ IntegerQ /@ ((n + d)/(p + d))]; Select[Range[10^6], qcp[#, 2] &] (* _Giovanni Resta_, May 21 2013 *)
%K A029562 nonn
%O A029562 1,1
%A A029562 _David W. Wilson_