|
|
A048152
|
|
Triangular array T read by rows: T(n,k) = k^2 mod n, for 1 <= k <= n, n >= 1.
|
|
18
|
|
|
0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 4, 4, 1, 0, 1, 4, 3, 4, 1, 0, 1, 4, 2, 2, 4, 1, 0, 1, 4, 1, 0, 1, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 9, 6, 5, 6, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 4, 1, 0, 1, 4, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Rows:
0;
1, 0;
1, 1, 0;
1, 0, 1, 0;
1, 4, 4, 1, 0;
1, 4, 3, 4, 1, 0;
|
|
MATHEMATICA
|
Flatten[Table[PowerMod[k, 2, n], {n, 15}, {k, n}]] (* Harvey P. Dale, Jun 20 2011 *)
|
|
PROG
|
(Haskell)
a048152 n k = a048152_tabl !! (n-1) !! (k-1)
a048152_row n = a048152_tabl !! (n-1)
a048152_tabl = zipWith (map . flip mod) [1..] a133819_tabl
|
|
CROSSREFS
|
Cf. A046071 (in ascending order, without zeros and duplicates).
Cf. A063987 (for primes, in ascending order, without zeros and duplicates).
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|