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).
FORMULA
From Jianing Song, Jun 12 2026: (Start)
a(n) == n^39 (mod 79).
Recurrence: a(n) = -a(n-1) - a(n-2) - .... - a(n-78). (End)
MATHEMATICA
JacobiSymbol[Range[0, 100], 79] (* Paolo Xausa, Nov 09 2025 *)
PROG
(PARI) a(n) = kronecker(n, 79) \\ Jianing Song, Jun 12 2026
CROSSREFS
KEYWORD
sign,mult,easy,changed
AUTHOR
STATUS
approved
