a(n) = lambda(sigma(n)), where lambda(n) 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.

A077198

a(n) = lambda(sigma(n)), where lambda(n) 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.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =6a(4) =2a(5) =2a(6) =2a(7) =4a(8) =12a(9) =6a(10) =2a(11) =6a(12) =6a(13) =2a(14) =2a(15) =30a(16) =6a(17) =12a(18) =4a(19) =6a(20) =8a(21) =6a(22) =2a(23) =4a(24) =30a(25) =6a(26) =4a(27) =6a(28) =4a(29) =6

External references