A070355 a(n) = 3^n mod 22.

1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15, 1, 3, 9, 5, 15

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

Formula

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

a(n) = a(n-5).

G.f.: (1+3*x+9*x^2+5*x^3+15*x^4)/ ((1-x) * (1+x+x^2+x^3+x^4)). (End)

Mathematica

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

Prog

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

Crossrefs

Cf. A000244.

Sequence in context: A327460 A084496 A084530 * A129145 A064471 A264798

Adjacent sequences: A070352 A070353 A070354 * A070356 A070357 A070358

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved