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!)
A049586 a(n) is the GCD of the cototients (A051953) of n and n+1. 6

%I #23 Sep 08 2022 08:44:58

%S 1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,1,1,3,3,1,1,1,1,1,1,1,1,1,1,1,1,1,

%T 1,1,1,5,3,1,1,1,1,3,3,1,1,1,1,1,1,1,1,3,1,1,3,1,1,1,1,1,1,1,1,1,1,1,

%U 1,1,1,1,1,1,5,1,1,1,1,3,3,1,1,3,1,1,1,1,1,1,1,3,3,1,1,1,1,1,3,1,1,1,1,1,3

%N a(n) is the GCD of the cototients (A051953) of n and n+1.

%C Most of the terms are 1.

%H Vincenzo Librandi, <a href="/A049586/b049586.txt">Table of n, a(n) for n = 0..5000</a>

%F a(n) = gcd(n + 1 - phi(n+1), n - phi(n)).

%F a(n) = gcd(A051953(n+1), A051953(n)).

%t Map[GCD @@ Map[# - EulerPhi@ # &, #] &, Partition[Range@ 106, 2, 1]] (* _Michael De Vlieger_, Aug 09 2017 *)

%o (Magma) [GCD((n+1-EulerPhi(n+1)), n-EulerPhi(n)): n in [1..100]]; // _Vincenzo Librandi_, Aug 10 2017

%Y Cf. A000010, A051953, A058515.

%K nonn

%O 0,9

%A _Labos Elemer_, Dec 28 2000

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)