a(n) is the least m>=n, such that the Hamming distance D(n,m)=2.
3, 2, 4, 5, 7, 6, 10, 11, 11, 10, 12, 13, 15, 14, 22, 23, 19, 18, 20, 21, 23, 22, 26, 27, 27
1 seqfan posts
Wed Apr 18 17:52:17 CEST 2012 [seqfan] Re: A conjecture on Hamming distance