|
%I #61 Oct 18 2022 06:05:30
%S 2,7,11,13,19,31,37,41,47,59,61,67,73,79,97,103,107,109,127,131,137,
%T 151,157,167,173,179,181,191,193,199,211,223,227,229,233,239,241,251,
%U 271,283,307,313,331,367,379,397,409,419,421,431,433,439,443,457,463,487,491,499,521,541,557,563
%N Odious primes: primes with odd number of 1's in binary expansion.
%C Conjecture: a(n) < A027699(n) except for n = 2; verified up to n=5*10^7. Moreover, I conjecture that A027699(n) - a(n) tends to infinity. - _Vladimir Shevelev_
%H T. D. Noe, <a href="/A027697/b027697.txt">Table of n, a(n) for n=1..10000</a>
%H E. Fouvry and C. Mauduit, <a href="http://dx.doi.org/10.1007/BF01444238">Sommes des chiffres et nombres presque premiers</a>, (French) [Sums of digits and almost primes] Math. Ann. 305 (1996), no. 3, 571--599. MR1397437 (97k:11029)
%H Ben Green, <a href="http://arXiv.org/abs/0710.0823">Three topics in additive prime number theory</a>, arXiv:0710.0823 [math.NT], Oct 03, 2007, pp. 12-27.
%H Vladimir Shevelev, <a href="https://doi.org/10.1155/2008/908045">Generalized Newman phenomena and digit conjectures on primes</a>, Internat. J. of Mathematics and Math. Sciences, 2008 (2008), Article ID 908045, 1-12.
%p a:=proc(n) local nn: nn:= convert(ithprime(n), base, 2): if `mod`(sum(nn[j], j =1..nops(nn)), 2)=1 then ithprime(n) else end if end proc: seq(a(n),n=1..103); # _Emeric Deutsch_, Oct 24 2007
%t Clear[BinSumOddQ];BinSumOddQ[a_]:=Module[{i,s=0},s=0;For[i=1,i<=Length[IntegerDigits[a,2]],s+=Extract[IntegerDigits[a,2],i];i++ ];OddQ[s]]; lst={};Do[p=Prime[n];If[BinSumOddQ[p],AppendTo[lst,p]],{n,4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Apr 06 2009 *)
%t Select[Prime@ Range@ 120, OddQ@ First@ DigitCount[#, 2] &] (* _Michael De Vlieger_, Feb 08 2016 *)
%o (PARI) f(p)={v=binary(p);s=0;for(k=1,#v,if(v[k]==1,s++));return(s%2)};
%o forprime(p=2, 563, if(f(p), print1(p,", "))) \\ _Washington Bomfim_, Jan 14 2011
%o (PARI) s=[]; forprime(p=2, 1000, if(norml2(binary(p))%2==1, s=concat(s, p))); s \\ _Colin Barker_, Feb 18 2014
%o (Python)
%o from sympy import primerange
%o print([n for n in primerange(1, 1001) if bin(n)[2:].count("1")%2]) # _Indranil Ghosh_, May 03 2017
%Y Cf. A027699, A066148, A066149, A081092.
%Y Cf. A000069 (odious numbers), A092246 (odd odious numbers)
%K nonn,easy,base
%O 1,1
%A _N. J. A. Sloane_
%E More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu)
|
