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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068212 a(n) = phi(n) divided by its largest prime factor. 2

%I #11 Jan 03 2017 02:26:30

%S 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,

%T 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,

%U 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

%N a(n) = phi(n) divided by its largest prime factor.

%F a(n) = A052126(A000010(n)) = A000010(n)/A068211(n) = A000010(n)/A006530(A000010(n)).

%t epn[n_]:=Module[{e=EulerPhi[n]},e/FactorInteger[e][[-1,1]]]; Array[ epn,100,3] (* _Harvey P. Dale_, Apr 18 2012 *)

%Y Cf. A000010, A006530, A052126, A068211.

%K nonn

%O 3,3

%A _Labos Elemer_, Feb 21 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)