A070465 a(n) = n^2 mod 43.

0, 1, 4, 9, 16, 25, 36, 6, 21, 38, 14, 35, 15, 40, 24, 10, 41, 31, 23, 17, 13, 11, 11, 13, 17, 23, 31, 41, 10, 24, 40, 15, 35, 14, 38, 21, 6, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 36, 6, 21, 38, 14, 35, 15, 40, 24, 10, 41, 31, 23, 17, 13, 11, 11, 13, 17, 23, 31, 41, 10, 24, 40

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, 0, 0, 1).

Formula

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

Mathematica

PowerMod[Range[0, 80], 2, 43] (* Harvey P. Dale, Nov 10 2011 *)

Prog

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

Crossrefs

Sequence in context: A070468 A070467 A070466 * A070464 A070463 A070462

Adjacent sequences: A070462 A070463 A070464 * A070466 A070467 A070468

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved