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!)
A083542 a(n) = phi(n+1)*phi(n), product of totients of two consecutive integers. 8

%I #25 Jul 10 2024 02:58:08

%S 1,2,4,8,8,12,24,24,24,40,40,48,72,48,64,128,96,108,144,96,120,220,

%T 176,160,240,216,216,336,224,240,480,320,320,384,288,432,648,432,384,

%U 640,480,504,840,480,528,1012,736,672,840,640,768,1248,936,720,960,864,1008

%N a(n) = phi(n+1)*phi(n), product of totients of two consecutive integers.

%H Reinhard Zumkeller, <a href="/A083542/b083542.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A000010(A002378(n)). - _Amiram Eldar_, Jul 10 2024

%p a:= n-> (p-> p(n)*p(n+1))(numtheory[phi]):

%p seq(a(n), n=1..60); # _Alois P. Heinz_, Jan 21 2022

%t Times @@ EulerPhi@ # & /@ Partition[Range@ 58, 2, 1] (* _Michael De Vlieger_, Mar 25 2017 *)

%t Times@@@Partition[EulerPhi[Range[60]],2,1] (* _Harvey P. Dale_, Oct 29 2019 *)

%o (Haskell)

%o a083542 n = a000010 n * a000010 (n + 1)

%o a083542_list = zipWith (*) (tail a000010_list) a000010_list

%o -- _Reinhard Zumkeller_, Apr 22 2012

%o (PARI) a(n) = eulerphi(n) * eulerphi(n+1); \\ _Amiram Eldar_, Jul 10 2024

%Y Cf. A000010, A002378, A058515, A066813, A330319 (partial sums).

%Y Cf. A083481, A083539, A092517.

%K nonn,easy,changed

%O 1,2

%A _Labos Elemer_, May 21 2003

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 July 15 16:36 EDT 2024. Contains 374333 sequences. (Running on oeis4.)