The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070367 a(n) = 5^n mod 11. 5
 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1, 5, 3, 4, 9, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Period 5: repeat [1, 5, 3, 4, 9]. LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1). FORMULA a(n) = (1/25)*{51*(n mod 5)-14*[(n+1) mod 5]+6*[(n+2) mod 5]+21*[(n+3) mod 5]-9*[(n+4) mod 5]}, with n>=0. - Paolo P. Lava, Feb 24 2010 From R. J. Mathar, Apr 20 2010 a(n) = a(n-5). G.f.: ( -1-5*x-3*x^2-4*x^3-9*x^4 ) / ( (x-1)*(1+x+x^2+x^3+x^4) ). (End) MATHEMATICA Table[Mod[5^n, 11], {n, 0, 100}] (* G. C. Greubel, Mar 05 2016 *) PROG (Sage) [power_mod(5, n, 11)for n in range(0, 101)] # Zerinvary Lajos, Nov 25 2009 (MAGMA) &cat[[1, 5, 3, 4, 9]^^20]; // Vincenzo Librandi, Mar 06 2016 (PARI) a(n)=lift(Mod(5, 11)^n) \\ Charles R Greathouse IV, Mar 22 2016 CROSSREFS Cf. A000351. Sequence in context: A319053 A109681 A196406 * A086308 A229943 A198132 Adjacent sequences:  A070364 A070365 A070366 * A070368 A070369 A070370 KEYWORD nonn,easy 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)