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 A138675 #2 Mar 31 2012 10:22:07
%S A138675 1,1,4,1,9,1,13,11,12,6,1,26,23,11,32,16,5,52,9,64,9,67,10,39,22,64,
%T A138675 79,64,63,7,32,20,64,34,64,148,27,21,63,119,64,156,64,43,64,188,123,
%U A138675 82,64
%N A138675 Prime(n)^6 mod prime(n-1).
%C A138675 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
%C A138675 prime(n) mod prime(n-1) is given in A001223
%C A138675 prime(n)^2 mod prime(n-1) is given in A038702
%C A138675 prime(n)^3 mod prime(n-1) is given in A138672
%C A138675 prime(n)^4 mod prime(n-1) is given in A138673
%C A138675 prime(n)^5 mod prime(n-1) is given in A138674
%C A138675 prime(n)^6 mod prime(n-1) is given in A138675
%C A138675 prime(n)^7 mod prime(n-1) is given in A138676
%C A138675 prime(n)^8 mod prime(n-1) is given in A138677
%C A138675 prime(n)^9 mod prime(n-1) is given in A138678
%C A138675 prime(n)^10 mod prime(n-1) is given in A138679
%C A138675 prime(n)^11 mod prime(n-1) is given in A138680
%C A138675 prime(n)^12 mod prime(n-1) is given in A138681
%e A138675 a(1)=1 because 3^6 = 729 = 1 mod 2
%e A138675 a(2)=2 because 5^6 = 15625 = 1 mod 3
%t A138675 Table[Mod[Prime[n]^6, Prime[n - 1]], {n, 2, 50}]
%Y A138675 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.
%K A138675 nonn
%O A138675 2,3
%A A138675 _Artur Jasinski_, Mar 26 2008