a(1)=1. a(n) = the smallest positive integer such that both a(n) and sum{k=1 to n} a(k) have the same number of (nonleading) 0's when they are represented in binary.
1, 5, 1, 6, 9, 4, 18, 8, 36, 16, 72, 32, 144, 64, 288, 128, 576, 256, 1152, 512, 2304
1 seqfan posts
Tue Jun 9 21:05:38 CEST 2009 [seqfan] Re: A078467: Proof of a(34) = 622699582951