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!)
 A271351 a(n) = 3^n mod 131. 2
 1, 3, 9, 27, 81, 112, 74, 91, 11, 33, 99, 35, 105, 53, 28, 84, 121, 101, 41, 123, 107, 59, 46, 7, 21, 63, 58, 43, 129, 125, 113, 77, 100, 38, 114, 80, 109, 65, 64, 61, 52, 25, 75, 94, 20, 60, 49, 16, 48, 13, 39, 117, 89, 5, 15, 45, 4, 12, 36, 108, 62, 55, 34, 102, 44, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 FORMULA a(n) = a(n-65). MATHEMATICA PowerMod[3, Range[0, 100], 131] PROG (MAGMA) [Modexp(3, n, 131): n in [0..100]]; (PARI) a(n) = lift(Mod(3, 131)^n); \\ Altug Alkan, Apr 05 2016 CROSSREFS Cf. similar sequences listed in A271350. Sequence in context: A057232 A036145 A014950 * A036143 A248960 A006521 Adjacent sequences:  A271348 A271349 A271350 * A271352 A271353 A271354 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Apr 05 2016 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 September 30 02:48 EDT 2020. Contains 337432 sequences. (Running on oeis4.)