Least number k such that the binary expansion of n*k has fewer ones than n, or 0 if no such k exists.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 5, 0, 0, 0, 0, 0, 27, 0, 0, 3, 3, 0, 41, 5, 3, 0, 5, 0, 0, 0, 0
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt