|
%I #6 May 16 2012 03:36:16
%S 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,
%T 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,
%U 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
%N Triangle T(n,k) = 1 if k-th prime is a square mod the n-th prime, otherwise 0, for 1<=k<n.
%e 0; 0,0; 1,0,0; 0,1,1,0; ...
%t 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 *)
%Y Cf. A060038.
%K nonn,tabl,easy,nice
%O 2,1
%A _N. J. A. Sloane_, Mar 17 2001
%E More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2001
|
