|
| |
|
|
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.
|
|
1
| |
|
|
1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 4, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 6, 1, 6, 5, 6, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 9, 4, 1, 0, 1, 4, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 8, 1, 8, 7, 8, 1, 8, 1, 8, 1, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,12
|
|
|
COMMENTS
| Fermat's little theorem states that T(n,m)=1 for all m relatively prime to n.
|
|
|
EXAMPLE
| Triangle begins {1}, {1, 1}, {1, 0, 1}, {1, 1, 1, 1}, {1, 4, 3, 4, 1}, ...
|
|
|
MATHEMATICA
| Table[PowerMod[ #, EulerPhi[n], n]&/@ Range[n-1], {n, 2, 32} ]
|
|
|
CROSSREFS
| Sequence in context: A048156 A070431 A070511 * A195597 A143505 A170987
Adjacent sequences: A066337 A066338 A066339 * A066341 A066342 A066343
|
|
|
KEYWORD
| easy,nonn,tabl,changed
|
|
|
AUTHOR
| Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jan 01 2002
|
| |
|
|
