[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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