login
A371884
Irregular triangle read by rows in which row n >= 2 lists the divisors d of n such that d^n mod n = d.
2
1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 5, 1, 1, 4, 1, 1, 7, 1, 5, 1, 1, 1, 9, 1, 1, 5, 1, 7, 1, 11, 1, 1, 1, 1, 13, 1, 1, 4, 1, 1, 6, 10, 15, 1, 1, 1, 11, 1, 17, 1, 1, 9, 1, 1, 19, 1, 13, 1, 1, 1, 7, 21, 1, 1, 1, 9, 1, 23, 1, 1, 16, 1, 1, 25, 1, 17, 1, 13, 1, 1, 27, 1, 11, 1, 8, 1, 19, 1, 29, 1, 1, 1, 1, 31, 1, 1, 1, 5, 13
OFFSET
2,6
EXAMPLE
Triangle begins:
1;
1;
1;
1;
1, 3;
1;
1;
1;
1, 5;
1;
1, 4;
1;
1, 7;
1, 5;
1;
1;
1, 9;
1;
1, 5;
1, 7;
1, 11;
1;
1;
1;
1, 13;
1;
1, 4;
1;
1, 6, 10, 15;
...
MATHEMATICA
row[n_] := Select[Divisors[n], PowerMod[#, n, n] == # &]; Array[row, 64, 2] // Flatten (* Amiram Eldar, Apr 11 2024 *)
PROG
(Magma) [[d: d in Divisors(n) | d^n mod n eq d]: n in [2..65]];
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
STATUS
approved