Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 May 06 2016 14:26:36
%S 1,1,2,1,2,2,3,1,2,2,5,2,0,3,4,1,2,2,0,2,6,5,3,2,0,0,3,3,4,4,5,1,2,2,
%T 0,2,5,0,4,2,5,6,4,5,4,3,0,2,0,0,4,0,4,3,0,3,4,4,5,4,6,5,6,1,2,2,0,2,
%U 5,0,4,2,6,5,4,0,4,4,5,2,5,5,4,6,4,4,3
%N a(n) = A065879(n)/n.
%C This sequence is bounded above by A272756.
%C a(n) is the least value i such that A000120(n * i) = i or 0 if no such value exists.
%H Peter Kagey, <a href="/A272759/b272759.txt">Table of n, a(n) for n = 1..10000</a>
%t Table[(SelectFirst[Range[2^12], # == n First@ DigitCount[#, 2] &] /.
%t k_ /; MissingQ@ k -> 0)/n, {n, 120}] (* *)
%Y Cf. A000120, A065879, A272756, A272760.
%K nonn,base
%O 1,3
%A _Peter Kagey_, May 05 2016