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 A256651 #23 Nov 10 2024 09:24:08
%S A256651 7,8,10,11,14,20,22,24,27,28,30,39,45,46,47,48,59,60,66,81,94,96,107,
%T A256651 118,124,147,166,167,172,179,189,192,200,203,210,214,225,227,231,247,
%U A256651 259,277,285,296,304,309,315,323,324,325,327,334,358,360,407,412,436
%N A256651 Numbers k for which both the number of evil numbers <= k and relatively prime to k, and the number of odious numbers <= k and relatively prime to k, are primes.
%C A256651 For odious-evil partition of positive integers, see A000069, A001969; for odious-evil partition of relatively prime to n numbers <=n, see A230070, A230120.
%C A256651 Since Euler totient sequence A000010 takes only even values, then for some of them we have a representations as a sum of two primes.
%H A256651 Peter J. C. Moses, <a href="/A256651/b256651.txt">Table of n, a(n) for n = 1..1000</a>
%o A256651 (PARI) is(k) = {my(c1 = 0, c2 = 0, h); for(i = 1, k, if(gcd(i, k) == 1, h = hammingweight(i) % 2; c1 += h; c2 += !h)); isprime(c1) && isprime(c2);} \\ _Amiram Eldar_, Nov 10 2024
%Y A256651 Cf. A000010, A000069, A001969, A230070, A230120.
%K A256651 nonn,base
%O A256651 1,1
%A A256651 _Vladimir Shevelev_, Apr 06 2015
%E A256651 More terms from _Peter J. C. Moses_, Apr 06 2015