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 A194579 #17 Jan 07 2020 09:07:47
%S A194579 4,6,8,10,12,16,22,27,28,32,40,44,46,52,58,68,80,82,88,106,112,116,
%T A194579 124,125,136,148,164,165,166,172,176,178,192,208,226,232,236,250,256,
%U A194579 262,284,292,304,316,328,332,346,352,358,368,382,388,420,428,435
%N A194579 Numbers whose sum of the their nonprime divisors is prime.
%H A194579 Amiram Eldar, <a href="/A194579/b194579.txt">Table of n, a(n) for n = 1..10000</a>
%e A194579 The divisors of 28 are {1, 2, 4, 7, 14, 28} and the sum of its nonprime divisors is 1 + 4 + 14 + 28 = 47 is prime, hence 28 is in the sequence.
%p A194579 with(numtheory): for n from 1 to 435 do x:=divisors(n): n1:=nops(x): s:=0: for k from 1 to n1 do if not isprime(x[k]) then s:=s+x[k] fi od: if isprime(s) then printf(`%d, `, n) fi od:
%t A194579 f[n_] := Plus @@ Select[Divisors[n], ! PrimeQ[#] &]; Select[Range[435], PrimeQ[f[#]] &] (* _T. D. Noe_, Aug 29 2011 *)
%o A194579 (PARI) isok(n) = isprime(sumdiv(n, d, if (!isprime(d), d))); \\ _Michel Marcus_, Jan 07 2020
%Y A194579 Cf. A194594.
%K A194579 nonn
%O A194579 1,1
%A A194579 _Michel Lagneau_, Aug 29 2011