A070505 a(n) = n^3 mod 43.

0, 1, 8, 27, 21, 39, 1, 42, 39, 41, 11, 41, 8, 4, 35, 21, 11, 11, 27, 22, 2, 16, 27, 41, 21, 16, 32, 32, 22, 8, 39, 35, 2, 32, 2, 4, 1, 42, 4, 22, 16, 35, 42, 0, 1, 8, 27, 21, 39, 1, 42, 39, 41, 11, 41, 8, 4, 35, 21, 11, 11, 27, 22, 2, 16, 27, 41, 21, 16, 32, 32, 22, 8, 39, 35, 2

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 31 2016

Mathematica

PowerMod[Range[0, 80], 3, 43] (* Bruno Berselli, Mar 31 2016 *)

Prog

(Sage) [power_mod(n, 3, 43) for n in range(0, 76)] # Zerinvary Lajos, Oct 30 2009
(Magma) [Modexp(n, 3, 43): n in [0..80]]; // Bruno Berselli, Mar 31 2016
(PARI) a(n)=n^3%43 \\ Charles R Greathouse IV, Apr 06 2016

Crossrefs

Sequence in context: A070508 A070507 A070506 * A070504 A070503 A070502

Adjacent sequences: A070502 A070503 A070504 * A070506 A070507 A070508

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved