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!)
 A138672 Prime(n)^3 mod prime(n-1). 11
 1, 2, 3, 1, 8, 12, 8, 7, 9, 8, 30, 27, 8, 21, 28, 4, 8, 33, 64, 8, 70, 64, 50, 67, 64, 8, 64, 8, 64, 32, 64, 85, 8, 27, 8, 65, 59, 64, 49, 43, 8, 95, 8, 64, 8, 136, 40, 64, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4) prime(n) mod prime(n-1) is given in A001223 prime(n)^2 mod prime(n-1) is given in A038702 prime(n)^3 mod prime(n-1) is given in A138672 prime(n)^4 mod prime(n-1) is given in A138673 prime(n)^5 mod prime(n-1) is given in A138674 prime(n)^6 mod prime(n-1) is given in A138675 prime(n)^7 mod prime(n-1) is given in A138676 prime(n)^8 mod prime(n-1) is given in A138677 prime(n)^9 mod prime(n-1) is given in A138678 prime(n)^10 mod prime(n-1) is given in A138679 prime(n)^11 mod prime(n-1) is given in A138680 prime(n)^12 mod prime(n-1) is given in A138681 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 EXAMPLE a(1)=1 because 3^3 = 27 = 1 mod 2 a(2)=2 because 5^3 = 125 = 2 mod 3 MATHEMATICA Table[Mod[Prime[n]^3, Prime[n - 1]], {n, 2, 50}] PowerMod[#[[2]], 3, #[[1]]] & /@ Partition[Prime[Range[50]], 2, 1] (* Harvey P. Dale, Apr 24 2017 *) CROSSREFS Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681. Sequence in context: A006015 A301332 A110292 * A103749 A098435 A096294 Adjacent sequences:  A138669 A138670 A138671 * A138673 A138674 A138675 KEYWORD nonn AUTHOR Artur Jasinski, Mar 26 2008 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 June 1 09:53 EDT 2020. Contains 334762 sequences. (Running on oeis4.)