This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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-8*x^3+10*x^4-19*x^5 ) / ( (x-1)*(1+x)*(x^4-x^3+x^2-x+1) ). (End) a(n) = (1/45)*{92*(n mod 10)-34*[(n+1) mod 10]+47*[(n+2) mod 10]+2*[(n+3) mod 10]+38*[(n+4) mod 10]-70*[(n+5) mod 10]+56*[(n+6) mod 10]-25*[(n+7) mod 10]+20*[(n+8) mod 10]-16*[(n+9) mod 10]}, with n>=0. - Paolo P. Lava, Apr 23 2010 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 xrange(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: A141391 A135766 A067745 * A176672 A107471 A107323 Adjacent sequences:  A070405 A070406 A070407 * A070409 A070410 A070411 KEYWORD nonn AUTHOR N. J. A. Sloane, May 12 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.