This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060039 Triangle T(n,k) = 1 if k-th prime is a square mod the n-th prime, otherwise 0, for 1<=k
 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS 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: A144602 A160351 A023969 * A107078 A163533 A020987 Adjacent sequences:  A060036 A060037 A060038 * A060040 A060041 A060042 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.