|
|
A212320
|
|
Irregular triangle: T(n, k) = k! modulo prime(n), 1<k<prime(n), 1<n.
|
|
1
|
|
|
2, 2, 1, 4, 2, 6, 3, 1, 6, 2, 6, 2, 10, 5, 2, 5, 1, 10, 2, 6, 11, 3, 5, 9, 7, 11, 6, 1, 12, 2, 6, 7, 1, 6, 8, 13, 15, 14, 1, 12, 3, 8, 1, 16, 2, 6, 5, 6, 17, 5, 2, 18, 9, 4, 10, 16, 15, 16, 9, 1, 18, 2, 6, 1, 5, 7, 3, 1, 9, 21, 1, 12, 18, 22, 8, 13, 14, 22, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
It is conjectured that only first and second row have all terms distinct.
This holds for n less than ten million. In Trudgian's terminology, there are no socialist primes less than 10^7. - Charles R Greathouse IV, Nov 05 2013
|
|
LINKS
|
|
|
EXAMPLE
|
Irregular triangle begins:
2;
2, 1, 4;
2, 6, 3, 1, 6;
2, 6, 2, 10, 5, 2, 5, 1, 10;
|
|
MATHEMATICA
|
row[n_] := With[{p = Prime[n]}, Mod[Range[2, p-1]!, p]]; Table[row[n], {n, 2, 9}] // Flatten (* Jean-François Alcover, Oct 25 2013 *)
|
|
PROG
|
(PARI) row(n) = {p = prime(n); for (i = 2, p-1, print1(i! % p, ", "); ); print(); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|