|
|
A202149
|
|
Triangle read by rows: T(n, k) = mod(2^k, n), where 1 <= k < n.
|
|
1
|
|
|
0, 2, 1, 2, 0, 0, 2, 4, 3, 1, 2, 4, 2, 4, 2, 2, 4, 1, 2, 4, 1, 2, 4, 0, 0, 0, 0, 0, 2, 4, 8, 7, 5, 1, 2, 4, 2, 4, 8, 6, 2, 4, 8, 6, 2, 2, 4, 8, 5, 10, 9, 7, 3, 6, 1, 2, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 2, 4, 8, 3, 6, 12, 11, 9, 5, 10, 7, 1, 2, 4, 8, 2, 4, 8, 2, 4
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
Rows indexed by odd primes end in 1 (and of course so do rows indexed by base 2 pseudoprimes, A001567). Of those rows, the ones that are permutations of the integers 1 to p - 1 correspond to primes with primitive root 2 (A001122).
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle starts:
0
2 1
2 0 0
2 4 3 1
2 4 2 4 2
2 4 1 2 4 1
2 4 0 0 0 0 0
2 4 8 7 5 1 2 4
2 4 8 6 2 4 8 6 2
2 4 8 5 10 9 7 3 6 1
2 4 8 4 8 4 8 4 8 4 8
|
|
MATHEMATICA
|
ColumnForm[Table[PowerMod[2, k, n], {n, 2, 20}, {k, n - 1}], Center]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|