login
A060039
Triangle T(n,k) = 1 if k-th prime is a square mod the n-th prime, otherwise 0, for 1<=k<n.
1
0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0
OFFSET
2,1
EXAMPLE
0; 0,0; 1,0,0; 0,1,1,0; ...
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
Cf. A060038.
Sequence in context: A336356 A319988 A023969 * A319710 A345951 A345952
KEYWORD
nonn,tabl,easy,nice
AUTHOR
N. J. A. Sloane, Mar 17 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2001
STATUS
approved