login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138672 Prime(n)^3 mod prime(n-1). 11

%I #6 Apr 24 2017 16:59:06

%S 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,

%T 64,32,64,85,8,27,8,65,59,64,49,43,8,95,8,64,8,136,40,64,8

%N Prime(n)^3 mod prime(n-1).

%C Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)

%C prime(n) mod prime(n-1) is given in A001223

%C prime(n)^2 mod prime(n-1) is given in A038702

%C prime(n)^3 mod prime(n-1) is given in A138672

%C prime(n)^4 mod prime(n-1) is given in A138673

%C prime(n)^5 mod prime(n-1) is given in A138674

%C prime(n)^6 mod prime(n-1) is given in A138675

%C prime(n)^7 mod prime(n-1) is given in A138676

%C prime(n)^8 mod prime(n-1) is given in A138677

%C prime(n)^9 mod prime(n-1) is given in A138678

%C prime(n)^10 mod prime(n-1) is given in A138679

%C prime(n)^11 mod prime(n-1) is given in A138680

%C prime(n)^12 mod prime(n-1) is given in A138681

%H Harvey P. Dale, <a href="/A138672/b138672.txt">Table of n, a(n) for n = 0..1000</a>

%e a(1)=1 because 3^3 = 27 = 1 mod 2

%e a(2)=2 because 5^3 = 125 = 2 mod 3

%t Table[Mod[Prime[n]^3, Prime[n - 1]], {n, 2, 50}]

%t PowerMod[#[[2]], 3, #[[1]]] & /@ Partition[Prime[Range[50]], 2, 1] (* _Harvey P. Dale_, Apr 24 2017 *)

%Y Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

%K nonn

%O 0,2

%A _Artur Jasinski_, Mar 26 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)