This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070777 a(1) = 1; a(n) = (largest prime factor of n) - 1. 11
 1, 1, 2, 1, 4, 2, 6, 1, 2, 4, 10, 2, 12, 6, 4, 1, 16, 2, 18, 4, 6, 10, 22, 2, 4, 12, 2, 6, 28, 4, 30, 1, 10, 16, 6, 2, 36, 18, 12, 4, 40, 6, 42, 10, 4, 22, 46, 2, 6, 4, 16, 12, 52, 2, 10, 6, 18, 28, 58, 4, 60, 30, 6, 1, 12, 10, 66, 16, 22, 6, 70, 2, 72, 36, 4, 18, 10, 12, 78, 4, 2, 40, 82, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Also a(n) = Euler Phi of largest prime factor of n (previous name). a(m*n) = max(a(m), a(n)). - Robert Israel, May 19 2015 LINKS FORMULA a(n) = A000010(A006530(n)) = A006530(n) - 1 if n >= 2. EXAMPLE 102 = 2*3*17, so a(102) = 17 - 1 = 16. MAPLE with(numtheory): A070777 := n -> `if`(n=1, 1, phi(max(op(factorset(n))))): # Peter Luschny, Oct 23 2010 MATHEMATICA a[n_] := EulerPhi[Last[FactorInteger[n]][[1]]]; Table[a[n], {n, 1, 200}] (* José María Grau Ribas, Feb 21 2010 *) PROG (PARI) a(n) = if (n==1, 1, vecmax(factor(n)[, 1]) - 1); \\ after A006530; Michel Marcus, May 19 2015 CROSSREFS Cf. A000010, A006530, A068211, A070812. Sequence in context: A147763 A098371 A300234 * A173614 A173557 A023900 Adjacent sequences:  A070774 A070775 A070776 * A070778 A070779 A070780 KEYWORD easy,nonn AUTHOR Labos Elemer, May 07 2002 EXTENSIONS New name from Michel Marcus, May 19 2015 STATUS approved

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

Last modified April 25 04:14 EDT 2019. Contains 322451 sequences. (Running on oeis4.)