OFFSET
1,1
COMMENTS
Numbers n such that in their prime factorization n = p_1^e_1 * ... * p_k^e_k, there is at least one pair of exponents e_i and e_j (i and j distinct), such that their base-2 representations have at least one shared digit-position in which both exponents have 1-bit.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
EXAMPLE
n = 6 = 2^1 * 3^1 is included as both exponents, 1 and 1 ("1" in binary) have both 1-bit in position 0 of their binary representations.
n = 24 = 2^3 * 3^1 is included as both exponents, 1 and 3 ("01" and "11" in binary) have both 1-bit in position 0 of their binary representations.
n = 36 = 2^2 * 3^2 is included as both exponents, 2 and 2 ("10" in binary) have both 1-bit in position 1 of their binary representations.
n = 60 = 2^2 * 3^1 * 5^1 is included as the exponents of 3 and 5, both of which are 1, have both 1-bit in position 1 of their binary representations.
MATHEMATICA
Select[Range@ 144, PrimeOmega@ # > BitOr @@ Map[Last, FactorInteger@ #] &] (* Michael De Vlieger, Feb 04 2016 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Feb 03 2016
STATUS
approved