A228436 Odd n such that n*d are both odious (A000069) or both evil (A001969) for every divisor d of n.
1, 3, 7, 11, 15, 19, 31, 41, 53, 59, 63, 67, 79, 83, 91, 97, 103, 105, 117, 127, 131, 141, 157, 167, 173, 179, 181, 185, 193, 217, 219, 223, 227, 229, 237, 239, 251, 255, 269, 271, 277, 281, 283, 291, 293, 303, 307, 311, 313, 317, 337, 347, 351, 359, 377
Offset: 1
Examples
Evil number n=15 has divisors {1,3,5,15}. Since all numbers 15*1=15, 15*3=45, 15*5=75 and 15*15=225 are evil, then 15 is a term.
Links
- Peter J. C. Moses, Table of n, a(n) for n = 1..5000
Programs
-
Mathematica
odiousQ[n_]:=OddQ[DigitCount[n,2][[1]]]; selQ[n_]:=OddQ[n] && Length[Union[Map[odiousQ, Map[n #&,Divisors[n]]]]] == 1; Select[Range[400], selQ] (* Peter J. C. Moses, Nov 10 2013 *)
-
PARI
isok(n) = (n % 2) && (!(s = sumdiv(n, d, hammingweight(n*d) % 2)) || (s == numdiv(n))); \\ Michel Marcus, Nov 10 2013
Extensions
More terms from Michel Marcus
Comments