OFFSET
1,2
COMMENTS
Equivalently, the set of divisors can be defined by {d | k, BitAnd(k, d) = d}.
Analogous to harmonic (or Ore) numbers (A001599) where the divisors d of k are restricted by BitOr(k, d) = k or BitAnd(k, d) = d.
If k is a term then so is 2*k. The primitive terms are in A362805. Thus, this sequence includes all the powers of 2 (A000079), all the numbers of the form 3*2^m and 15*2^m for m >= 1, and all the numbers of the form 7*2^m for m >= 2.
All the even perfect numbers (A000396) are terms: if k = 2^(p-1)*(2^p-1) is a perfect number (where p is a Mersenne exponent, A000043), then the only divisors of k such that BitOr(k, d) = k are 2^(p-1) and k itself, and the harmonic mean of 2^(p-1) and 2^(p-1)*(2^p-1) is 2^p - 1.
Are 1 and 45 the only odd terms in this sequence?
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..406
MATHEMATICA
q[n_] := IntegerQ[HarmonicMean[Select[Divisors[n], BitAnd[n, #] == # &]]]; Select[Range[10^4], q]
PROG
(PARI) div(n) = select(x->(bitor(x, n) == n), divisors(n));
is(n) = {my(d = div(n)); denominator(#d/sum(i = 1, #d, 1/d[i])) == 1; }
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, May 04 2023
STATUS
approved