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!)
 A240546 a(n) = prime(n+1)^n mod prime(n). 2
 1, 1, 3, 4, 10, 1, 9, 5, 16, 9, 26, 10, 33, 1, 2, 49, 33, 3, 35, 48, 3, 32, 62, 64, 4, 20, 8, 62, 93, 83, 64, 41, 68, 79, 138, 125, 88, 56, 4, 169, 72, 36, 40, 144, 73, 140, 63, 120, 24, 218, 67, 48, 58, 194, 126, 54, 74, 223, 74, 59, 176, 161, 280, 208, 215, 236, 82, 141, 139, 344, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS (prime(k+1)^k mod prime(k)) = k: 1, 3, 4, 76, 7743, ... . LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 EXAMPLE a(5) = prime(5+1)^5 mod prime(5) = 13^5 mod 11 = 10. MAPLE a:= n-> ithprime(n+1) &^n mod ithprime(n): seq(a(n), n=1..100);  # Alois P. Heinz, Apr 30 2014 MATHEMATICA Table[Mod[Prime[n + 1]^n, Prime[n]], {n, 80}] (* Alonso del Arte, Apr 11 2014 *) Table[PowerMod[Prime[n+1], n, Prime[n]], {n, 80}] (* Harvey P. Dale, Jun 11 2019 *) PROG (MAGMA) [(NthPrime(n+1)^n mod NthPrime(n)): n in [1..100]]; // Juri-Stepan Gerasimov, Apr 07 2014 (PARI) a(n)=my(p=prime(n)); lift(Mod(nextprime(p+1), p)^n) \\ Charles R Greathouse IV, Apr 08 2014 CROSSREFS Cf. A038702. Sequence in context: A015240 A032477 A073015 * A248003 A063930 A183170 Adjacent sequences:  A240543 A240544 A240545 * A240547 A240548 A240549 KEYWORD nonn,less AUTHOR Irina Gerasimova, Apr 07 2014 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 April 20 09:13 EDT 2021. Contains 343125 sequences. (Running on oeis4.)