A070363 a(n) = 3^n mod 46.

1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41, 31, 1, 3, 9, 27, 35, 13, 39, 25, 29, 41

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

Formula

From R. J. Mathar, Feb 08 2011: (Start)

a(n) = a(n-11).

G.f.: (-1-3*x-9*x^2-27*x^3-35*x^4-13*x^5-39*x^6-25*x^7-29*x^8-41*x^9

-31*x^10) / ((x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10)). (End)

Mathematica

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

Prog

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

Crossrefs

Cf. A000244.

Sequence in context: A161141 A057238 A070364 * A305617 A292390 A211219

Adjacent sequences: A070360 A070361 A070362 * A070364 A070365 A070366

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved