OFFSET
1,1
COMMENTS
Since phi is irrational, n/EulerPhi(n) can only approximate phi. Probably an open question: can |(n/EulerPhi(n)) - phi| be made arbitrarily close to 0?
The listed terms have this property: for r = 1,...,5, all r-digit terms share the same set of prime factors. For example, all three 3-digit terms have prime factors 3 and 13. Furthermore, all listed terms are multiples of 3. I conjecture that these properties hold in general.
EXAMPLE
|3/EulerPhi(3) - phi| = 0.118034 (approximately) is minimal for all one-digit numbers, with 3/EulerPhi(3) = 9/EulerPhi(9) = 3/2.
|117/EulerPhi(117) - phi| = 0.006966 (approximately) is minimal for all three-digit numbers, with 117/EulerPhi(117) = 351/Eulerphi(351) = 507/EulerPhi(507) = 13/8.
MAPLE
A065657 := proc(n) gr := (1+sqrt(5))/2 ; appr := 1000000+n ; dg := {} ;
for k from 10^(n-1) to 10^n-1 do
qual := abs(k/numtheory[phi](k)-gr) ;
if dg = {} or is(qual < appr) then dg := {k} ; appr := qual ;
elif qual = appr then dg := dg union {k} ;
end if;
end do:
print(sort(dg)) ;
end proc:
for n from 1 do A065657(n) ; end do: # R. J. Mathar, Nov 16 2010
MATHEMATICA
run[k_] := run[k] = SplitBy[Sort[Table[{Abs[n/EulerPhi[n] - GoldenRatio] // N, n}, {n, 10^(k-1), 10^k-1}]], First][[1]][[All, 2]];
Table[Print[run[k]]; run[k], {k, 1, 7}] // Flatten (* Jean-François Alcover, Jun 22 2019 *)
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Joseph L. Pe, Dec 03 2001
EXTENSIONS
Edited and link fixed; would someone check this sequence? - Charles R Greathouse IV, Aug 02 2010
Checked up to and including the 5-digit terms, replaced prime factor example in the comment - R. J. Mathar, Nov 16 2010
a(12)-a(16) from Donovan Johnson, Sep 25 2011
STATUS
approved