evil	odious
The first 16 evil and odious numbers in little-endian binary. It can be seen, that both sequences differ only in the least significant bits, which form the Thue–Morse sequence for the evil, and its negation for the odious numbers. The other bits form the even numbers.

In number theory, an odious number is a positive integer that has an odd number of 1s in its binary expansion. Non-negative integers that are not odious are called evil numbers.

In computer science, an odious number is said to have odd parity.

The first odious numbers are:

If ${\displaystyle a(n)}$ denotes the ${\displaystyle n}$th odious number (with ${\displaystyle a(0)=1}$), then for all ${\displaystyle n}$, ${\displaystyle a(a(n))=2a(n)}$.^[2]

Every positive integer ${\displaystyle n}$ has an odious multiple that is at most ${\displaystyle n(n+4)}$. The numbers for which this bound is tight are exactly the Mersenne numbers with even exponents, the numbers of the form ${\displaystyle n=2^{2r}-1}$, such as 3, 15, 63, etc. For these numbers, the smallest odious multiple is exactly ${\displaystyle n(n+4)=2^{4r}+2^{2r+1}-3}$.^[3]

The odious numbers give the positions of the nonzero values in the Thue–Morse sequence. Every power of two is odious, because its binary expansion has only one nonzero bit. Except for 3, every Mersenne prime is odious, because its binary expansion consists of an odd prime number of consecutive nonzero bits.

Non-negative integers that are not odious are called evil numbers. The partition of the non-negative integers into the odious and evil numbers is the unique partition of these numbers into two sets that have equal multisets of pairwise sums.^[4]

Wikifunctions has a odious number checking function.

• Weisstein, Eric W., "Odious Number", MathWorld