cp's OEIS Frontend

A138678 Prime(n)^9 mod prime(n-1).

%I A138678 #8 Aug 16 2013 17:01:28
%S A138678 1,2,2,1,6,12,2,1,16,19,30,36,20,16,3,11,40,8,40,15,46,22,2,32,50,7,9,
%T A138678 84,108,111,16,128,101,84,65,107,23,40,81,100,154,159,130,50,118,96,
%U A138678 67,119,58
%N A138678 Prime(n)^9 mod prime(n-1).
%C A138678 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
%C A138678 prime(n) mod prime(n-1) is given in A001223
%C A138678 prime(n)^2 mod prime(n-1) is given in A038702
%C A138678 prime(n)^3 mod prime(n-1) is given in A138672
%C A138678 prime(n)^4 mod prime(n-1) is given in A138673
%C A138678 prime(n)^5 mod prime(n-1) is given in A138674
%C A138678 prime(n)^6 mod prime(n-1) is given in A138675
%C A138678 prime(n)^7 mod prime(n-1) is given in A138676
%C A138678 prime(n)^8 mod prime(n-1) is given in A138677
%C A138678 prime(n)^9 mod prime(n-1) is given in A138678
%C A138678 prime(n)^10 mod prime(n-1) is given in A138679
%C A138678 prime(n)^11 mod prime(n-1) is given in A138680
%C A138678 prime(n)^12 mod prime(n-1) is given in A138681
%H A138678 Harvey P. Dale, <a href="/A138678/b138678.txt">Table of n, a(n) for n = 2..1000</a>
%e A138678 a(1)=1 because 3^9 = 1 mod 2
%e A138678 a(2)=2 because 5^9 = 2 mod 3
%t A138678 Table[Mod[Prime[n]^9, Prime[n - 1]], {n, 2, 50}]
%t A138678 PowerMod[Last[#],9,First[#]]&/@Partition[Prime[Range[50]],2,1] (* _Harvey P. Dale_, Aug 16 2013 *)
%Y A138678 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.
%K A138678 nonn
%O A138678 2,2
%A A138678 _Artur Jasinski_, Mar 26 2008