Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Aug 12 2024 09:35:22
%S 1,5,7,9,13,17,23,29,31,37,41,49,53,61,71,73,85,89,97,101,103,109,113,
%T 119,125,127,129,133,137,149,151,157,167,173,181,193,197,199,217,223,
%U 229,233,241,249,257,263,269,277,281,293,311,313,317,321,325,337,341
%N Numbers k such that k and k+d are both odious (A000069) or both evil (A001969) for every divisor d of k.
%C A prime p is a term iff its binary expansion ends in odd number of 1's (A095283). All terms are in A079523.
%H Peter J. C. Moses, <a href="/A231271/b231271.txt">Table of n, a(n) for n = 1..10000</a>
%e The odious number k = 341 has divisors {1, 11, 31, 341}. Since the numbers 341 + 1 = 342, 341 + 11 = 352, 341 + 31 = 372, 341 + 341 = 682 are all odious, then 341 is a term.
%t odiousQ[n_] := OddQ[DigitCount[n, 2][[1]]];selQ[n_] := Length[Union[Map[odiousQ, Flatten[{n, Map[n+#&, Divisors[n]]}]]]] == 1; Select[Range[200], selQ] (* _Peter J. C. Moses_, Nov 08 2013 *)
%o (PARI) is(k) = {my(hw = hammingweight(k) % 2); fordiv(k, d, if(hammingweight(k+d) % 2 != hw, return(0))); 1;} \\ _Amiram Eldar_, Aug 12 2024
%Y Cf. A000069, A001969, A079523, A095283.
%K nonn,base
%O 1,2
%A _Vladimir Shevelev_, Nov 06 2013
%E More terms from _Peter J. C. Moses_, Nov 08 2013