OFFSET
1,1
COMMENTS
I can show that for r > 1, the first r-digit term of the sequence is the smallest r-digit primorial, if it exists. It remains to investigate the first terms when existence fails. It is also not hard to see that for r > 1, the r-digit terms are in arithmetic progression with common difference equal to the smallest r-digit term. For example, 210, 420, 630, 840 are in arithmetic progression with common difference 210. Obviously the r-digit minimizer of k/phi(k) is the largest prime of k digits.
LINKS
Sean A. Irvine, Java program (github).
EXAMPLE
30/phi(30) = 15/4 is maximal for two-digit numbers.
210/phi(210) = 35/8 is maximal for three-digit numbers.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Joseph L. Pe, Dec 05 2001
EXTENSIONS
a(13)-a(15) corrected and a(16)-a(30) from Sean A. Irvine, Sep 15 2023
STATUS
approved