This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A138677 #4 Nov 05 2014 08:22:23 %S A138677 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 A138677 42,27,16,4,65,119,64,107,43,30,10,97,132,77,34,65,109,59,8,199,197, %U A138677 29,42,152,17,183,175,121,98,256,229,164,256,252,210,145,256 %N A138677 Prime(n)^8 mod prime(n-1). %C A138677 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4) %C A138677 prime(n) mod prime(n-1) is given in A001223 %C A138677 prime(n)^2 mod prime(n-1) is given in A038702 %C A138677 prime(n)^3 mod prime(n-1) is given in A138672 %C A138677 prime(n)^4 mod prime(n-1) is given in A138673 %C A138677 prime(n)^5 mod prime(n-1) is given in A138674 %C A138677 prime(n)^6 mod prime(n-1) is given in A138675 %C A138677 prime(n)^7 mod prime(n-1) is given in A138676 %C A138677 prime(n)^8 mod prime(n-1) is given in A138677 %C A138677 prime(n)^9 mod prime(n-1) is given in A138678 %C A138677 prime(n)^10 mod prime(n-1) is given in A138679 %C A138677 prime(n)^11 mod prime(n-1) is given in A138680 %C A138677 prime(n)^12 mod prime(n-1) is given in A138681 %e A138677 a(1)=1 because 3^8 = 1 mod 2 %e A138677 a(2)=2 because 5^8 = 1 mod 3 %t A138677 Table[Mod[Prime[n]^8, Prime[n - 1]], {n, 2, 50}] %t A138677 PowerMod[#[[2]],8,#[[1]]]&/@Partition[Prime[Range[70]],2,1] (* _Harvey P. Dale_, Nov 05 2014 *) %Y A138677 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681. %K A138677 nonn %O A138677 2,4 %A A138677 _Artur Jasinski_, Mar 26 2008 %E A138677 More terms from _Harvey P. Dale_, Nov 05 2014