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!)
 A168399 a(n) = 3^n mod 13. 3
 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9, 1, 3, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Equivalently: 3^(n+3*m) mod 13. - G. C. Greubel, Jul 20 2016 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,1). FORMULA From R. J. Mathar, Apr 13 2010: (Start) a(n) = a(n-3). G.f.: (1 + 3*x + 9*x^2)/ ((1-x)*(1+x+x^2)). (End) MATHEMATICA Table[Mod[3^n, 13], {n, 0, 50}] (* G. C. Greubel, Jul 20 *) PROG (Sage) [power_mod(3, n, 13)for n in range(0, 93)] # (PARI) a(n)=lift(Mod(3, 13)^n) \\ Charles R Greathouse IV, Mar 22 2016 (MAGMA) [Modexp(3, n, 13): n in [0..110]]; // Vincenzo Librandi, Jul 21 2016 CROSSREFS Sequence in context: A304022 A103556 A254348 * A290375 A245081 A010631 Adjacent sequences:  A168396 A168397 A168398 * A168400 A168401 A168402 KEYWORD nonn,easy AUTHOR Zerinvary Lajos, Nov 25 2009 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 July 29 04:25 EDT 2021. Contains 346340 sequences. (Running on oeis4.)