A070463 a(n) = n^2 mod 41.

0, 1, 4, 9, 16, 25, 36, 8, 23, 40, 18, 39, 21, 5, 32, 20, 10, 2, 37, 33, 31, 31, 33, 37, 2, 10, 20, 32, 5, 21, 39, 18, 40, 23, 8, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 36, 8, 23, 40, 18, 39, 21, 5, 32, 20, 10, 2, 37, 33, 31, 31, 33, 37, 2, 10, 20, 32, 5, 21, 39, 18, 40, 23, 8, 36

Offset

0,3

Links

G. C. Greubel, Table of n, a(n) for n = 0..1000

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

Formula

a(n) = a(n-41). - G. C. Greubel, Mar 25 2016

Mathematica

Table[Mod[n^2, 41], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 27 2011 *)
PowerMod[Range[0, 80], 2, 41] (* Harvey P. Dale, Apr 06 2019 *)

Prog

(PARI) a(n)=n^2%41 \\ Charles R Greathouse IV, Apr 06 2016

Crossrefs

Cf. A070461, A070462.

Sequence in context: A070466 A070465 A070464 * A070462 A070461 A070460

Adjacent sequences: A070460 A070461 A070462 * A070464 A070465 A070466

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved