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 A216894 #19 Feb 12 2015 15:10:25
%S A216894 1,6,22,54,68,164,166,336,388,454,588,854,886,1086,1122,1124,1636,
%T A216894 1710,1828,2182,2356,2468,2702,2960,3046,3048,3708,3748,3770,4036,
%U A216894 4054,4655,5106,5394,5636,6502,7108,7368,7956,8324,9170,9188,9412,9438,9471,9726
%N A216894 n - (sum of prime factors of n) is a positive square.
%C A216894 Contains 4p for odd prime p if 3p-2 is a square, in particular if p is in A122430. - _Robert Israel_, Apr 13 2014
%H A216894 Robert Israel, <a href="/A216894/b216894.txt">Table of n, a(n) for n = 1..2121</a>
%e A216894 54 = 2*3^3 and 54 -(2+3) = 49 is a square, hence 54 is in the sequence.
%p A216894 filter:= proc(x) local y;
%p A216894 y:= x - add(i, i=numtheory:-factorset(x));
%p A216894 y > 0 and issqr(y)
%p A216894 end proc;
%p A216894 N:= 10000; # to get all entries <= N
%p A216894 A216894:= select(filter,[$1..N]); # _Robert Israel_, Apr 13 2014
%t A216894 nspfQ[n_]:=Module[{c=n-Total[Transpose[FactorInteger[n]][[1]]]},c>0 && IntegerQ[ Sqrt[c]]]; Join[{1},Select[Range[10000],nspfQ]] (* _Harvey P. Dale_, Feb 12 2015 *)
%Y A216894 Cf. A008472.
%K A216894 nonn
%O A216894 1,2
%A A216894 _Michel Lagneau_, Sep 19 2012