|
Search: id:A006511
|
|
|
| A006511 |
|
Largest inverse of totient function (A000010): a(n) is the largest x such that phi(x)=m, where m=A002202(n) is the n-th number in the range of phi.
(Formerly M1580)
|
|
+0
7
|
|
| 2, 6, 12, 18, 30, 22, 42, 60, 54, 66, 46, 90, 58, 62, 120, 126, 150, 98, 138, 94, 210, 106, 162, 174, 118, 198, 240, 134, 142, 270, 158, 330, 166, 294, 276, 282, 420, 250, 206, 318, 214, 378, 242, 348, 354, 462, 254, 510, 262, 414, 274, 278, 426, 630, 298, 302
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Always even, as phi(2n)=phi(n) when n is odd. - Alain Jacques (thegentleway(AT)bigpond.com), Jun 15 2006
|
|
REFERENCES
|
J. W. L. Glaisher, Number-Divisor Tables. British Assoc. Math. Tables, Vol. 8, Camb. Univ. Press, 1940, p. 64.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..2374
|
|
FORMULA
|
a(n) = A057635(A002202(n)). - T. D. Noe
|
|
MATHEMATICA
|
phiinv[n_, pl_] := Module[{i, p, e, pe, val}, If[pl=={}, Return[If[n==1, {1}, {}]]]; val={}; p=Last[pl]; For[e=0; pe=1, e==0||Mod[n, (p-1)pe/p]==0, e++; pe*=p, val=Join[val, pe*phiinv[If[e==0, n, n*p/pe/(p-1)], Drop[pl, -1]]]]; Sort[val]]; phiinv[n_] := phiinv[n, Select[1+Divisors[n], PrimeQ]]; Last/@Select[phiinv/@Range[1, 200], #!={}&] (* phiinv[n, pl] = list of x with phi(x)=n and all prime divisors of x in list pl. phiinv[n] = list of x with phi(x)=n *)
|
|
CROSSREFS
|
Cf. A000010, A002202, A002181.
For records see A036913, A132154, A036912.
Sequence in context: A085345 A032371 A108585 this_sequence A113274 A036913 A117311
Adjacent sequences: A006508 A006509 A006510 this_sequence A006512 A006513 A006514
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
