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!)
 A271350 a(n) = 3^n mod 83. 3
 1, 3, 9, 27, 81, 77, 65, 29, 4, 12, 36, 25, 75, 59, 11, 33, 16, 48, 61, 17, 51, 70, 44, 49, 64, 26, 78, 68, 38, 31, 10, 30, 7, 21, 63, 23, 69, 41, 40, 37, 28, 1, 3, 9, 27, 81, 77, 65, 29, 4, 12, 36, 25, 75, 59, 11, 33, 16, 48, 61, 17, 51, 70, 44, 49, 64, 26 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). FORMULA a(n) = a(n-41). MATHEMATICA PowerMod[3, Range[0, 100], 83] PROG (MAGMA) [Modexp(3, n, 83): n in [0..100]]; (PARI) a(n) = lift(Mod(3, 83)^n); \\ Altug Alkan, Apr 05 2016 CROSSREFS Cf. similar sequences of the type 3^n mod p, where p is a prime: A070352 (5), A033940 (7), A070341 (11), A168399 (13), A036119 (17), A070342 (19), A070356 (23), A070344 (29), A036123 (31), A070346 (37), A070361 (41), A036126 (43), A070364 (47), A036134 (79), this sequence (83), A036136 (89), A036142 (113), A036143 (127), A271351 (131), A036145 (137), A036158 (199), A271352 (211), A036160 (223). Sequence in context: A001218 A036158 A036136 * A057262 A057232 A036145 Adjacent sequences:  A271347 A271348 A271349 * A271351 A271352 A271353 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 28 08:33 EDT 2020. Contains 337394 sequences. (Running on oeis4.)