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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063872 Let m be the n-th positive integer such that phi(m) is divisible by m - phi(m). Then a(n) = phi(m)/(m - phi(m)). 2
 1, 2, 1, 4, 6, 1, 2, 10, 12, 1, 16, 18, 22, 4, 2, 28, 30, 1, 36, 40, 42, 46, 6, 52, 58, 60, 1, 66, 70, 72, 78, 2, 82, 88, 96, 100, 102, 106, 108, 112, 10, 4, 126, 1, 130, 136, 138, 148, 150, 156, 162, 166, 12, 172, 178, 180, 190, 192, 196, 198, 210, 222, 226, 228, 232 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS m is the n-th prime power larger than 1; i.e., m = A000961(n+1). Proof: If phi(m) is divisible by m-phi(m), then m is divisible by m-phi(m). Let k be the product of the distinct prime factors of m. Then phi(m)/m = phi(k)/k, so k/(k-phi(k)) = m/(m-phi(m)) is an integer. Thus k is divisible by k-phi(k) and k is squarefree. Let k-phi(k) = d and k/(k-phi(k)) = e; note that e>1 and GCD(d,e)=1. Thus d = k - phi(k) = d e - phi(d e) = d e - phi(d) phi(e) so d (e-1) = d e - d = phi(d) phi(e) <= phi(d) (e-1) and d <= phi(d). But this implies that d=1, so phi(k)=k-1 and k is prime. Hence m is a prime power. - Dean Hickerson, Aug 28 2001 For primes, quotient = (p - 1) / 1 = p - 1; for prime powers, p^a, a > 1: quotient = p^(a - 1)(p - 1) / p^(a - 1) = p - 1, so each p - 1 values occur infinitely often: a(n) + 1 = root of n-th prime power with positive exponent, i.e., A025473(n+1). - [Edited by] Daniel Forgues, May 08 2014 "LCM numeral system": a(n+1) is maximum digit for index n, n >= 0; a(-n) is maximum digit for index n, n < 0. - Daniel Forgues, May 03 2014 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 OEIS Wiki, LCM numeral system FORMULA a(n) = A025473(n + 1) - 1. - Bill McEachen, Sep 11 2021 MATHEMATICA epd[n_]:=Module[{ep=EulerPhi[n]}, If[Divisible[ep, n-ep], ep/(n-ep), Nothing]]; Array[epd, 300, 2] (* Harvey P. Dale, Dec 27 2020 *) PROG (PARI) M(n) = ispower(n, , &n); if (isprime(n), n, 1); \\ A014963 apply(x->x-1, select(isprime, apply(x->M(x+1), [1..260]))) \\ Michel Marcus, Sep 14 2021 CROSSREFS Cf. A000010, A051953, A007694, A000961, A054740, A049237, A025473. Sequence in context: A002987 A210958 A188925 * A199909 A033884 A208915 Adjacent sequences: A063869 A063870 A063871 * A063873 A063874 A063875 KEYWORD easy,nonn AUTHOR Labos Elemer, Aug 27 2001 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 November 29 15:30 EST 2022. Contains 358431 sequences. (Running on oeis4.)