OFFSET
2,1
COMMENTS
Conjecture: a(n) exists for all n >= 2.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 2..10000
PROG
(PARI) a(n)=my(e=2*n--+hammingweight(n)%2, m=1); e>>=valuation(e, 2); while(hammingweight(e^m++)%2==0, ); m \\ Charles R Greathouse IV, Mar 22 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vladimir Shevelev, May 24 2010, May 25 2010
EXTENSIONS
Extended by Jeremy Gardiner, May 26 2010
Edited by N. J. A. Sloane, Jun 08 2010
STATUS
approved