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

 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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 MATHEMATICA Table[CarmichaelLambda[EulerPhi[n]], {n, 1, 100}] PROG (PARI) a(n)=lcm(znstar(eulerphi(n))[2]) \\ Charles R Greathouse IV, Feb 21 2013 CROSSREFS Cf. A000010, A002322, A206941. Sequence in context: A091110 A339660 A104659 * A320510 A117173 A241061 Adjacent sequences:  A077194 A077195 A077196 * A077198 A077199 A077200 KEYWORD nonn AUTHOR Joseph L. Pe, Nov 29 2002 STATUS approved

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.

Last modified August 1 12:37 EDT 2021. Contains 346385 sequences. (Running on oeis4.)