This site is supported by donations to The OEIS Foundation.
Fermat's triangle
From OeisWiki
T (n, m) = m φ (n) mod n |
n |
m φ (n) mod n |
m = 1 |
T (n, m) = m φ (n) mod n |
n ≥ 2, 1 ≤ m ≤ n − 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, ...}
n |
n |
Row sums
A?????? Row sums of Fermat’s triangle:
m φ (n) mod n |
n ≥ 2 |
- {1, 2, 2, 4, 13, 6, 4, 6, 33, 10, 38, 12, 61, 52, 8, ...}
n |
p k, k ≥ 1, |
n (
|
n (
|
q ≥ 2 |
n |
q k, k ≥ 1 |