This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A191561 a(n) = 2^n mod 3*n 1
 2, 4, 8, 4, 2, 10, 2, 16, 26, 4, 2, 28, 2, 4, 8, 16, 2, 28, 2, 16, 8, 4, 2, 64, 32, 4, 80, 16, 2, 64, 2, 64, 8, 4, 53, 28, 2, 4, 8, 16, 2, 64, 2, 16, 107, 4, 2, 64, 128, 124, 8, 16, 2, 82, 98, 88, 8, 4, 2, 136, 2, 4, 134, 64, 32, 64, 2, 16, 8, 184, 2, 136, 2, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[PowerMod[2, n, 3 n], {n, 100}] (* Vincenzo Librandi, Jun 12 2016 *) PROG (MAGMA) [Modexp(2, n, 3*n): n in [1..100]]; // Vincenzo Librandi, Jun 12 2016 (PARI) a(n)=lift(Mod(2, 3*n)^n) \\ Charles R Greathouse IV, Dec 27 2011 CROSSREFS Cf. A083528, A083529, A083530. Sequence in context: A231610 A225124 A059884 * A021805 A031401 A191333 Adjacent sequences:  A191558 A191559 A191560 * A191562 A191563 A191564 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Jul 31 2011 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.

Last modified October 17 12:01 EDT 2018. Contains 316279 sequences. (Running on oeis4.)