login
A011627
Legendre symbol (n,229).
2
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.
FORMULA
a(n) = a(n-229). - Andrew Howroyd, Nov 17 2025
From Jianing Song, Jun 12 2026: (Start)
a(n) == n^114 (mod 229).
Recurrence: a(n) = -a(n-1) - a(n-2) - .... - a(n-228). (End)
MATHEMATICA
JacobiSymbol[Range[0, 80], 229] (* Harvey P. Dale, Feb 12 2022 *)
PROG
(PARI) a(n) = kronecker(n, 229); \\ Andrew Howroyd, Nov 17 2025
CROSSREFS
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: A011624 A011625 A011626 * A011628 A011629 A011630
KEYWORD
sign,mult,easy,changed
STATUS
approved