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 A073319 #9 Jan 03 2017 02:29:36
%S A073319 19,23,29,31,37,43,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,
%T A073319 121,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,
%U A073319 211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,289,293
%N A073319 Numbers n such that A073318(n) = 2^phi(n) - Sum_{j=0..n} binomial(phi(n), phi(j)) is positive.
%F A073319 Solutions to A066781(x) - A073317(x) > 0.
%e A073319 Several values are composites: 121, 289, 437, 529, ..., 961, 989. Primes like 2, ..., 17, 41 are not here.
%t A073319 g[x_] := EulerPhi[x] Do[s=2^g[n]-Apply[Plus, Table[Binomial[g[n], g[j]], {j, 0, n}]]; If[Sign[s]==1&&!PrimeQ[n], k=k+1; Print[{k, n, PrimeQ[n]}]], {n, 1, 1000}]
%Y A073319 Cf. A066781, A073317, A073318.
%K A073319 nonn
%O A073319 1,1
%A A073319 _Labos Elemer_, Jul 26 2002