A011600 Legendre symbol (n,83).

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

Offset

0,1

References

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 68.

Links

Paolo Xausa, Table of n, a(n) for n = 0..10000

Index entries for linear recurrences with constant coefficients, signature (-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1).

Formula

From Jianing Song, Jun 12 2026: (Start)

a(n) == n^41 (mod 83).

Recurrence: a(n) = -a(n-1) - a(n-2) - .... - a(n-82). (End)

Mathematica

JacobiSymbol[Range[0, 100], 83] (* Paolo Xausa, Nov 09 2025 *)

Prog

(PARI) a(n) = kronecker(n, 83) \\ Jianing Song, Jun 12 2026

Crossrefs

Cf. A191050 (primes decomposing in Q(sqrt(-83))), A191082 (primes remaining inert).

Legendre symbols mod p: A102283 (p=3), A080891 (p=5), A175629 (p=7), A011582-A011631 (p=11-251), A165573 (p=257), A165574 (p=263).

Sequence in context: A324672 A330035 A011599 * A011601 A011602 A011603

Adjacent sequences: A011597 A011598 A011599 * A011601 A011602 A011603

Keyword

sign,mult,easy

Author

N. J. A. Sloane

Status

approved