a(1)=1, for n>1, a(n) is the least number > a(n-1) such that the Hamming distance D(a(n-1), a(n)) = 2.
1, 2, 4, 7, 11, 13, 14, 22, 26, 28, 31, 47, 55, 59, 61, 62, 94, 110, 118, 122, 124, 127
2 seqfan posts
Wed Apr 18 17:52:17 CEST 2012 [seqfan] Re: A conjecture on Hamming distance