A070404 a(n) = 7^n mod 11.

1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9, 8, 1, 7, 5, 2, 3, 10, 4, 6, 9

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

Formula

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

a(n) = a(n-1) - a(n-5) + a(n-6).

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

a(n) = a(n-10). - G. C. Greubel, Mar 20 2016

Mathematica

PowerMod[7, Range[0, 100], 11] (* or *) LinearRecurrence[{1, 0, 0, 0, -1, 1}, {1, 7, 5, 2, 3, 10}, 100] (* Harvey P. Dale, Jul 17 2015 *)

Prog

(Sage) [power_mod(7, n, 11) for n in range(0, 99)] # Zerinvary Lajos, Nov 03 2009
(PARI) a(n) = lift(Mod(7, 11)^n); \\ Altug Alkan, Mar 20 2016
(Magma) [Modexp(7, n, 11): n in [0..100]]; // Bruno Berselli, Mar 22 2016

Crossrefs

Sequence in context: A306538 A191503 A318172 * A258370 A135537 A212038

Adjacent sequences: A070401 A070402 A070403 * A070405 A070406 A070407

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved