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

%I #4 Nov 05 2014 08:22:23

%S 1,1,1,2,3,3,1,5,18,24,5,9,10,4,24,46,20,42,10,43,32,45,28,4,61,54,28,

%T 42,27,16,4,65,119,64,107,43,30,10,97,132,77,34,65,109,59,8,199,197,

%U 29,42,152,17,183,175,121,98,256,229,164,256,252,210,145,256

%N Prime(n)^8 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

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

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

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

%t PowerMod[#[[2]],8,#[[1]]]&/@Partition[Prime[Range[70]],2,1] (* _Harvey P. Dale_, Nov 05 2014 *)

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

%K nonn

%O 2,4

%A _Artur Jasinski_, Mar 26 2008

%E More terms from _Harvey P. Dale_, Nov 05 2014

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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)