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 A138681 #2 Mar 31 2012 10:22:07
%S A138681 1,1,1,1,4,1,16,7,6,7,1,10,37,35,37,44,25,20,14,49,8,65,17,8,96,56,61,
%T A138681 30,45,49,8,7,123,44,73,9,101,115,128,148,158,82,85,112,156,121,148,
%U A138681 34,10
%N A138681 Prime(n)^12 mod prime(n-1).
%C A138681 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
%C A138681 prime(n) mod prime(n-1) is given in A001223
%C A138681 prime(n)^2 mod prime(n-1) is given in A038702
%C A138681 prime(n)^3 mod prime(n-1) is given in A138672
%C A138681 prime(n)^4 mod prime(n-1) is given in A138673
%C A138681 prime(n)^5 mod prime(n-1) is given in A138674
%C A138681 prime(n)^6 mod prime(n-1) is given in A138675
%C A138681 prime(n)^7 mod prime(n-1) is given in A138676
%C A138681 prime(n)^8 mod prime(n-1) is given in A138677
%C A138681 prime(n)^9 mod prime(n-1) is given in A138678
%C A138681 prime(n)^10 mod prime(n-1) is given in A138679
%C A138681 prime(n)^11 mod prime(n-1) is given in A138680
%C A138681 prime(n)^12 mod prime(n-1) is given in A138681
%e A138681 a(1)=1 because 3^12 = 1 mod 2
%e A138681 a(2)=2 because 5^12 = 1 mod 3
%t A138681 Table[Mod[Prime[n]^12, Prime[n - 1]], {n, 2, 50}]
%Y A138681 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.
%K A138681 nonn
%O A138681 2,5
%A A138681 _Artur Jasinski_, Mar 26 2008