|
|
|
|
1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 5, 2, 0, 3, 4, 1, 2, 2, 0, 2, 6, 5, 5, 2, 0, 0, 4, 3, 4, 4, 5, 1, 2, 2, 0, 2, 6, 0, 4, 2, 6, 6, 4, 5, 4, 5, 0, 2, 0, 0, 4, 0, 6, 4, 0, 3, 5, 4, 5, 4, 6, 5, 6, 1, 2, 2, 0, 2, 6, 0, 5, 2, 6, 6, 4, 0, 6, 4, 6, 2, 6, 6, 6, 6, 5, 4, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This sequence is bounded above by A272756.
a(n) is the greatest value i such that A000120(n * i) = i or 0 if no such value exists.
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[SelectFirst[Reverse@ Range@ #, First@ DigitCount[#, 2] == #/n &] &[n SelectFirst[Range[2^12], # > IntegerLength[n #, 2] &]]/n, {n, 120}] /. k_ /; MissingQ@ k -> 0 (* Michael De Vlieger, May 05 2016, Version 10.2 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|