This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A272759 #16 May 06 2016 14:26:36
%S A272759 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 A272759 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 A272759 5,0,4,2,6,5,4,0,4,4,5,2,5,5,4,6,4,4,3
%N A272759 a(n) = A065879(n)/n.
%C A272759 This sequence is bounded above by A272756.
%C A272759 a(n) is the least value i such that A000120(n * i) = i or 0 if no such value exists.
%H A272759 Peter Kagey, <a href="/A272759/b272759.txt">Table of n, a(n) for n = 1..10000</a>
%t A272759 Table[(SelectFirst[Range[2^12], # == n First@ DigitCount[#, 2] &] /.
%t A272759 k_ /; MissingQ@ k -> 0)/n, {n, 120}] (* *)
%Y A272759 Cf. A000120, A065879, A272756, A272760.
%K A272759 nonn,base
%O A272759 1,3
%A A272759 _Peter Kagey_, May 05 2016