A056051 a(n) = (n-2)! - 1 (mod n).

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

Offset

2,1

Comments

(n-2)! - 1 is congruent to 0 iff n is a prime and is congruent to -1 iff n is a composite > 4.

Links

Antti Karttunen, Table of n, a(n) for n = 2..10000

Mathematica

Do[m = Mod[(n - 2)! - 1, n]; If[m < 2, Print[m], Print[m - n]], {n, 2, 100}]

Prog

(PARI) A056051(n) = { my(m=(((n-2)!-1)%n)); if(m < 2, m, m-n); }; \\ Antti Karttunen, Sep 14 2017, after Mathematica-code.

Crossrefs

Cf. A005171.

Sequence in context: A178226 A288622 A095907 * A143541 A359583 A344120

Adjacent sequences: A056048 A056049 A056050 * A056052 A056053 A056054

Keyword

easy,sign

Author

Robert G. Wilson v, Jul 25 2000

Status

approved