The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A316785 Numerator of an upper bound for the maximal element in phi^(-1)(n). 2
 2, 6, 6, 15, 10, 21, 14, 30, 18, 33, 22, 455, 26, 42, 30, 255, 34, 133, 38, 165, 42, 69, 46, 455, 50, 78, 54, 435, 58, 2387, 62, 255, 66, 102, 70, 319865, 74, 114, 78, 1353, 82, 301, 86, 345, 90, 141, 94, 7735, 98, 165, 102, 795, 106, 399, 110, 435, 114, 177, 118, 1892891 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A057635(n) <= a(n)/A316786(n). LINKS R. Coleman, Some remarks on Euler's totient function, HAL Id: hal-00718975, version 1, 2012. H. Gupta, Euler's totient function and its inverse, Indian J. Pure Appl. Math., 12(1) (1981), 22-29. FORMULA Numerator of n*Product_{p prime, (p-1)|n} p/(p-1). EXAMPLE For n = 12, there are 5 primes p with (p-1)|12: p1 = 2, p2 = 3, p3 = 5, p4 = 7, and p5 = 13. The numerator of 12*(2/1)*(3/2)*(5/4)*(7/6)*(13/12) = 455/8 is a(12) = 455. MAPLE with(numtheory): A316785 := proc(n) local d, N; N:=n; for d in divisors(n) do if is prime(d+1) then N := (N*(d+1))/(d) end if; end do; numer(N); end proc; MATHEMATICA a[n_] := Block[{p = Select[Prime@ Range@ PrimePi[n + 1], Mod[n, # - 1] == 0 &]}, Numerator[n*Times @@ (p/(p - 1))]]; Array[a, 60] (* Robert G. Wilson v, Aug 01 2018 *) PROG (PARI) a(n) = my(p=n); fordiv(n, d, if (isprime(d+1), p *= (d+1)/d)); numerator(p); \\ Michel Marcus, Jul 29 2018 CROSSREFS Cf. A057635, A316786 (denominators). Sequence in context: A321302 A294735 A251548 * A056136 A349288 A098571 Adjacent sequences:  A316782 A316783 A316784 * A316786 A316787 A316788 KEYWORD nonn,frac AUTHOR Franz Vrabec, Jul 13 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 25 04:05 EDT 2022. Contains 354048 sequences. (Running on oeis4.)