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 A248023 #18 Jul 25 2017 02:33:07
%S A248023 50,98,242,338,392,578,722,800,968,1058,1250,1352,1682,1922,2312,2450,
%T A248023 2738,2888,3362,3698,3872,4232,4418,4802,5408,5618,6050,6272,6728,
%U A248023 6962,7442,7688,8450,8978,9248,10082,10658,10952,11552,12482,12800,13448,13778,14450
%N A248023 Even numbers which are neither primes nor perfect powers and are coprime to the sum of their divisors.
%H A248023 G. C. Greubel, <a href="/A248023/b248023.txt">Table of n, a(n) for n = 1..1500</a>
%e A248023 50 is in the sequence since it is neither a prime nor a powerful number and its divisors 1, 2, 5, 10, 25, and 50 sum to 93, which is coprime to 50.
%t A248023 perfectPowerQ[n_] := n == 1 || GCD @@ FactorInteger[n][[All, 2]] > 1; Select[ 2 Range@ 7500, !PrimeQ[ #] && GCD[#, DivisorSigma[1, #]] == 1 && !perfectPowerQ[ #] &]
%o A248023 (PARI) lista(nn) = {forstep(n=4, nn, 2, if (!ispower(n) && (gcd(n, sigma(n))==1), print1(n, ", ")););} \\ _Michel Marcus_, Oct 02 2014
%Y A248023 Cf. A003624, A106543, A248020.
%K A248023 nonn,easy
%O A248023 1,1
%A A248023 _Robert G. Wilson v_, Sep 29 2014