The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A140080

Fix e = 3; a(n) = minimal Hamming distance between the binary representation of n and the binary representation of any multiple ke (0 <= k <= n/e) which is a child of n.