A070359 a(n) = 3^n mod 34.

1, 3, 9, 27, 13, 5, 15, 11, 33, 31, 25, 7, 21, 29, 19, 23, 1, 3, 9, 27, 13, 5, 15, 11, 33, 31, 25, 7, 21, 29, 19, 23, 1, 3, 9, 27, 13, 5, 15, 11, 33, 31, 25, 7, 21, 29, 19, 23, 1, 3, 9, 27, 13, 5, 15, 11, 33, 31, 25, 7, 21, 29, 19, 23, 1, 3, 9, 27, 13, 5, 15, 11, 33, 31, 25, 7, 21

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

Formula

From R. J. Mathar, Apr 20 2010: (Start)

a(n) = a(n-1) - a(n-8) + a(n-9).

G.f.: ( -1-2*x-6*x^2-18*x^3+14*x^4+8*x^5-10*x^6+4*x^7-23*x^8 ) / ( (x-1)*(1+x^8) ). (End)

a(n) = a(n-16). - G. C. Greubel, Mar 09 2016

Mathematica

PowerMod[3, Range[0, 50], 34] (* or *) Table[Mod[3^n, 34], {n, 0, 100}] (* G. C. Greubel, Mar 09 2016 *)
LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, -1, 1}, {1, 3, 9, 27, 13, 5, 15, 11, 33}, 100] (* Harvey P. Dale, Mar 12 2023 *)

Prog

(PARI) a(n)=lift(Mod(3, 34)^n) \\ Charles R Greathouse IV, Mar 22 2016

Crossrefs

Sequence in context: A328754 A070345 A272584 * A271015 A131997 A122842

Adjacent sequences: A070356 A070357 A070358 * A070360 A070361 A070362

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved