A070344 a(n) = 3^n mod 29.

1, 3, 9, 27, 23, 11, 4, 12, 7, 21, 5, 15, 16, 19, 28, 26, 20, 2, 6, 18, 25, 17, 22, 8, 24, 14, 13, 10, 1, 3, 9, 27, 23, 11, 4, 12, 7, 21, 5, 15, 16, 19, 28, 26, 20, 2, 6, 18, 25, 17, 22, 8, 24, 14, 13, 10, 1, 3, 9, 27, 23, 11, 4, 12, 7, 21, 5, 15, 16, 19, 28

Offset

0,2

Links

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

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

Formula

a(n) = a(n-28). - G. C. Greubel, Mar 12 2016

Mathematica

PowerMod[3, Range[0, 50], 29] (* G. C. Greubel, Mar 12 2016 *)

Prog

(Sage) [power_mod(3, n, 29)for n in range(0, 71)] # Zerinvary Lajos, Nov 25 2009
(PARI) a(n)=lift(Mod(3, 29)^n) \\ Charles R Greathouse IV, Mar 22 2016

Crossrefs

Sequence in context: A321540 A036123 A168427 * A070357 A131137 A370871

Adjacent sequences: A070341 A070342 A070343 * A070345 A070346 A070347

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved