Fermat's triangle: T(n,m) = m^phi(n) mod n; n >= 2; 1 <= m <= n-1, where phi is Euler's totient function.
A066340
Fermat's triangle: T(n,m) = m^phi(n) mod n; n >= 2; 1 <= m <= n-1, where phi is Euler's totient function.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =4a(12) =3a(13) =4a(14) =1a(15) =1a(16) =1a(17) =1a(18) =1a(19) =1a(20) =1a(21) =1a(22) =0a(23) =1a(24) =0a(25) =1a(26) =0a(27) =1a(28) =1a(29) =1
External references
- oeis: A066340