|
|
A096459
|
|
Triangle read by rows: T(n,k) = n^2 mod prime(k), 1<=k<=n.
|
|
1
|
|
|
1, 0, 1, 1, 0, 4, 0, 1, 1, 2, 1, 1, 0, 4, 3, 0, 0, 1, 1, 3, 10, 1, 1, 4, 0, 5, 10, 15, 0, 1, 4, 1, 9, 12, 13, 7, 1, 0, 1, 4, 4, 3, 13, 5, 12, 0, 1, 0, 2, 1, 9, 15, 5, 8, 13, 1, 1, 1, 2, 0, 4, 2, 7, 6, 5, 28, 0, 0, 4, 4, 1, 1, 8, 11, 6, 28, 20, 33, 1, 1, 4, 1, 4, 0, 16, 17, 8, 24, 14, 21, 5, 0, 1, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
T(n,k)=0 iff k is a prime factor of n:
A001221(n) = number of zeros in n-th row;
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
1, 0, 4;
0, 1, 1, 2;
1, 1, 0, 4, 3;
0, 0, 1, 1, 3, 10;
1, 1, 4, 0, 5, 10, 15;
......
|
|
MATHEMATICA
|
Table[Mod[n^2, Prime[k]], {n, 1, 10}, {k, 1, n}] (* G. C. Greubel, May 20 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|