A070358 a(n) = 3^n mod 32.

1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25, 11, 1, 3, 9, 27, 17, 19, 25

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

Formula

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

a(n) = a(n-8).

G.f.: ( -1-3*x-9*x^2-27*x^3-17*x^4-19*x^5-25*x^6-11*x^7 ) / ( (x-1)*(1+x)*(x^2+1)*(x^4+1) ). (End)

Mathematica

PowerMod[3, Range[0, 50], 32] (* or *) Table[Mod[3^n, 32], {n, 0, 100}] (* G. C. Greubel, Mar 09 2016 *)

Prog

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

Crossrefs

Cf. A000244.

Sequence in context: A271015 A131997 A122842 * A321542 A321540 A036123

Adjacent sequences: A070355 A070356 A070357 * A070359 A070360 A070361

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved