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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077197 a(n) = lambda(phi(n)) where lambda(n) (A002322) is the Carmichael lambda function which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n and phi(n) is A000010. 4

%I

%S 1,1,1,1,2,1,2,2,2,2,4,2,2,2,2,2,4,2,6,2,2,4,10,2,4,2,6,2,6,2,4,4,4,4,

%T 2,2,6,6,2,4,4,2,6,4,2,10,22,4,6,4,8,2,12,6,4,2,6,6,28,4,4,4,6,8,4,4,

%U 10,8,10,2,12,2,6,6,4,6,4,2,12,8,18,4,40,2,16,6,6,4,10,2,6,10,4,22,6,8

%N a(n) = lambda(phi(n)) where lambda(n) (A002322) is the Carmichael lambda function which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n and phi(n) is A000010.

%H Charles R Greathouse IV, <a href="/A077197/b077197.txt">Table of n, a(n) for n = 1..10000</a>

%t Table[CarmichaelLambda[EulerPhi[n]], {n, 1, 100}]

%o (PARI) a(n)=lcm(znstar(eulerphi(n))[2]) \\ _Charles R Greathouse IV_, Feb 21 2013

%Y Cf. A000010, A002322, A206941.

%K nonn

%O 1,5

%A _Joseph L. Pe_, Nov 29 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 20:34 EDT 2021. Contains 347672 sequences. (Running on oeis4.)