The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068212 a(n) = phi(n) divided by its largest prime factor. 2
 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 4, 2, 4, 4, 8, 2, 6, 4, 4, 2, 2, 4, 4, 4, 6, 4, 4, 4, 6, 8, 4, 8, 8, 4, 12, 6, 8, 8, 8, 4, 6, 4, 8, 2, 2, 8, 6, 4, 16, 8, 4, 6, 8, 8, 12, 4, 2, 8, 12, 6, 12, 16, 16, 4, 6, 16, 4, 8, 10, 8, 24, 12, 8, 12, 12, 8, 6, 16, 18, 8, 2, 8, 32, 6, 8, 8, 8, 8, 24, 4, 12, 2, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,3 LINKS FORMULA a(n) = A052126(A000010(n)) = A000010(n)/A068211(n) = A000010(n)/A006530(A000010(n)). MATHEMATICA epn[n_]:=Module[{e=EulerPhi[n]}, e/FactorInteger[e][[-1, 1]]]; Array[ epn, 100, 3] (* Harvey P. Dale, Apr 18 2012 *) CROSSREFS Cf. A000010, A006530, A052126, A068211. Sequence in context: A078641 A072628 A193386 * A323015 A105194 A008335 Adjacent sequences:  A068209 A068210 A068211 * A068213 A068214 A068215 KEYWORD nonn AUTHOR Labos Elemer, Feb 21 2002 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 15 06:12 EDT 2021. Contains 342975 sequences. (Running on oeis4.)