cp's OEIS Frontend

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.

A268476 Balanced evil primes: primes with an even number of runs of 1's in their binary expansion.

This page as a plain text file.
%I A268476 #19 Feb 11 2017 02:28:52
%S A268476 5,11,13,17,19,23,29,47,59,61,67,71,79,97,103,113,131,149,173,181,191,
%T A268476 193,199,223,227,239,241,251,257,263,271,277,293,331,337,347,349,373,
%U A268476 383,421,449,463,479,487,499,503,509,557,587,593,599,601,613,617,619
%N A268476 Balanced evil primes: primes with an even number of runs of 1's in their binary expansion.
%C A268476 Primes in A268412. Complement of A268477.
%H A268476 Chai Wah Wu, <a href="/A268476/b268476.txt">Table of n, a(n) for n = 1..10000</a>
%H A268476 Vladimir Shevelev, <a href="http://arxiv.org/abs/1603.04434">Two analogs of Thue-Morse sequence</a>, arXiv:1603.04434 [math.NT], 2016.
%t A268476 Select[Prime@ Range@ 120, EvenQ@ Length[Split@ IntegerDigits[#, 2] /. {0, ___} -> Nothing] &] (* _Michael De Vlieger_, Feb 08 2016 *)
%o A268476 (Python)
%o A268476 from sympy import prime
%o A268476 A268476_list = [p for p in (prime(i) for i in range(1,10**6)) if not len(list(filter(bool,format(p,'b').split('0')))) % 2] # _Chai Wah Wu_, Mar 01 2016
%Y A268476 Cf. A027699, A268412, A268477.
%K A268476 nonn,base
%O A268476 1,1
%A A268476 _Vladimir Shevelev_, Feb 05 2016
%E A268476 More terms from _Peter J. C. Moses_, Feb 05 2016