A112448 a(n) = 1 if 2*n+1 is prime, otherwise a(n) = minimal residue of (-1)^binomial(n+2,2) mod (2n+1).

0, -1, 1, 1, 0, -1, 1, 0, -1, -1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, -1, -1, 0, 1, 0, 0, 1, 0, 0, -1, 1, 0, 0, -1, 0, 1, -1, 0, 0, 1, 0, -1, 0, 0, -1, 0, 0, 0, -1, 0, 1, 1, 0, -1, 1, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, -1, -1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, -1, 0, 1, 0, 0, 1, 0, 0, -1, 1, 0, 0, 0, 0, 1, -1, 0, 1, 1, 0, 0

Offset

0,1

Links

Table of n, a(n) for n=0..101.

Eric Weisstein's World of Mathematics, Wilson's Theorem

Mathematica

Table[If[PrimeQ[2 n + 1], (-1)^Binomial[n + 2, 2], 0], {n, 0, 101}] (* Michael De Vlieger, Aug 22 2015 *)

Prog

(PARI) a(n) = if (isprime(2*n+1), ((-1)^ (binomial(n+2, 2))), 0); \\ Michel Marcus, Aug 16 2015

Crossrefs

Apart from signs, same as A101264.

Sequence in context: A130854 A165191 A189576 * A101264 A189723 A095770

Adjacent sequences: A112445 A112446 A112447 * A112449 A112450 A112451

Keyword

sign

Author

Eric W. Weisstein, Dec 12 2005

Status

approved