OFFSET
1,1
COMMENTS
An analog of abundant numbers k (A005101), in which the divisor sum is restricted to divisors d whose 1-bits in their binary expansions are common with those of k.
If k is a term then 2*k is also a term. Therefore all the terms can be generated from the primitive set of the odd terms (A359085).
The least term that is not divisible by 4095 is a(208) = 1099511627775 = 2^40 - 1.
LINKS
MATHEMATICA
s[n_] := DivisorSum[n, # &, BitAnd[n, #] == # &]; Select[Range[10^6], s[#] > 2*# &]
PROG
(PARI) is(n) = sumdiv(n, d, d * (bitor(n, d) == n)) > 2*n;
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, Dec 15 2022
STATUS
approved