login
A070404
a(n) = 7^n mod 11.
4
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
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
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved