A070399 a(n) = 6^n mod 31.

1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 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 (1,0,-1,1).

Formula

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

a(n) = a(n-1) - a(n-3) + a(n-4).

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

a(n) = a(n-6). - G. C. Greubel, Mar 18 2016

Mathematica

PowerMod[6, Range[0, 50], 31] (* G. C. Greubel, Mar 18 2016 *)

Prog

(Sage) [power_mod(6, n, 31)for n in range(0, 83)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(6, 31)^n); \\ Altug Alkan, Mar 18 2016

Crossrefs

Sequence in context: A298155 A219931 A296192 * A137763 A029763 A283980

Adjacent sequences: A070396 A070397 A070398 * A070400 A070401 A070402

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved