|
|
A060038
|
|
Triangle T(n,k) = 0 if k-th prime is a square mod the n-th prime, otherwise 1, for 1<=k<n.
|
|
1
|
|
|
1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
LINKS
|
|
|
EXAMPLE
|
1; 1,1; 0,1,1; 1,0,0,1; ... [The third row is 0,1,1 because mod 7, 2 is a square but 3 and 5 are not]
|
|
MATHEMATICA
|
t[n_, k_] := Boole[ Reduce[ Mod[Prime[k] - j^2, Prime[n]] == 0, j, Integers] === False]; Flatten[ Table[ t[n, k], {n, 2, 15}, {k, 1, n - 1}]] (* Jean-François Alcover, May 16 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2001
|
|
STATUS
|
approved
|
|
|
|