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!)
 A138679 Prime(n)^10 mod prime(n-1). 10

%I

%S 1,1,4,4,1,9,4,4,4,9,25,33,40,21,18,13,21,48,26,30,57,9,12,78,6,14,36,

%T 61,105,85,64,113,65,6,130,38,138,160,152,81,129,142,69,7,39,157,171,

%U 30,116

%N Prime(n)^10 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="/A138679/b138679.txt">Table of n, a(n) for n = 2..1000</a>

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

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

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

%t PowerMod[Last[#],10,First[#]]&/@Partition[Prime[Range[50]],2,1] (* _Harvey P. Dale_, Apr 17 2014 *)

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

%K nonn

%O 2,3

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 31 13:01 EDT 2020. Contains 334748 sequences. (Running on oeis4.)