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!)
A129335 a(n) = phi(n!!) where phi is the Euler totient function. In other words, a(n) = A000010(A006882(n)). 1

%I #20 Mar 08 2020 08:36:40

%S 1,1,2,4,8,16,48,128,432,1024,4320,12288,51840,147456,777600,2359296,

%T 12441600,42467328,223948800,849346560,4702924800,16986931200,

%U 103464345600,407686348800,2586608640000,9784472371200,69838433280000

%N a(n) = phi(n!!) where phi is the Euler totient function. In other words, a(n) = A000010(A006882(n)).

%H Amiram Eldar, <a href="/A129335/b129335.txt">Table of n, a(n) for n = 1..808</a>

%F If n>2 is prime, a(n) = (n-1)*a(n-2). If n=2*p, where p is odd prime, a(n)=(n-2)*a(n-2). Otherwise, a(n) = n*a(n-2). - _Max Alekseyev_, May 26 2007

%t Table[EulerPhi[n!! ], {n, 1, 30}] (* _Stefan Steinerberger_, May 30 2007 *)

%Y Cf. A000010, A006882, A048855.

%K nonn

%O 1,3

%A _Leroy Quet_, May 26 2007

%E More terms from _Stefan Steinerberger_, May 30 2007

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 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)