OFFSET
1,3
COMMENTS
That is, numbers such that A116416(n) equals 1.
2k is in this sequence if and only if 2k + 1 is. Therefore n + a(n) is odd for all n. - Peter Kagey, Apr 19 2016
LINKS
Peter Kagey, Table of n, a(n) for n = 1..450 (All terms less than 2^30)
EXAMPLE
For n=39, 39_10=100111_2, and 1/1 + 1/2 + 1/3 + 1/6 = 2, an integer.
MATHEMATICA
Select[Range[2^20], IntegerQ@ Total[1/Flatten@ Position[Reverse@ IntegerDigits[#, 2], 1]] &] (* Michael De Vlieger, Apr 18 2016 *)
PROG
(PARI) isok(n) = {my(b = Vecrev(binary(n))); denominator(sum(k=1, #b, b[k]/k)) == 1; }
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Apr 18 2016
STATUS
approved