a(1)=1. For n >=2, a(n) = the smallest integer > a(n-1) such that both a(n) and a(n)-a(n-1) have the same number of (nonleading) 0's when they are represented in binary.
1, 6, 7, 13, 22, 26, 44, 52, 88, 104, 176, 208, 352, 416, 704, 832, 1408, 1664, 2816
1 seqfan posts
Tue Jun 9 21:05:38 CEST 2009 [seqfan] Re: A078467: Proof of a(34) = 622699582951