login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070408
a(n) = 7^n mod 22.
1
1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13, 3, 21, 15, 17, 9, 19, 1, 7, 5, 13
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-8*x^3+10*x^4-19*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, 50], 22] (* G. C. Greubel, Mar 20 2016 *)
PROG
(Sage) [power_mod(7, n, 22) for n in range(0, 84)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(7, 22)^n); \\ Altug Alkan, Mar 20 2016
(Magma) [Modexp(7, n, 22): n in [0..100]]; // Bruno Berselli, Mar 22 2016
CROSSREFS
Sequence in context: A135766 A067745 A369797 * A176672 A107471 A332768
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved