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 A138680 #6 Apr 04 2013 15:11:13 %S A138680 1,2,3,2,2,10,8,16,1,18,26,21,39,41,14,25,42,44,37,60,50,36,72,1,24, %T A138680 28,41,15,93,60,2,23,130,60,111,77,43,151,77,140,79,153,138,28,78,93, %U A138680 153,120,5 %N A138680 Prime(n)^11 mod prime(n-1). %C A138680 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4) %C A138680 prime(n) mod prime(n-1) is given in A001223 %C A138680 prime(n)^2 mod prime(n-1) is given in A038702 %C A138680 prime(n)^3 mod prime(n-1) is given in A138672 %C A138680 prime(n)^4 mod prime(n-1) is given in A138673 %C A138680 prime(n)^5 mod prime(n-1) is given in A138674 %C A138680 prime(n)^6 mod prime(n-1) is given in A138675 %C A138680 prime(n)^7 mod prime(n-1) is given in A138676 %C A138680 prime(n)^8 mod prime(n-1) is given in A138677 %C A138680 prime(n)^9 mod prime(n-1) is given in A138678 %C A138680 prime(n)^10 mod prime(n-1) is given in A138679 %C A138680 prime(n)^11 mod prime(n-1) is given in A138680 %C A138680 prime(n)^12 mod prime(n-1) is given in A138681 %H A138680 Harvey P. Dale, <a href="/A138680/b138680.txt">Table of n, a(n) for n = 2..1000</a> %e A138680 a(1)=1 because 3^11 = 1 mod 2 %e A138680 a(2)=2 because 5^11 = 2 mod 3 %t A138680 Table[Mod[Prime[n]^11, Prime[n - 1]], {n, 2, 50}] %t A138680 PowerMod[Last[#],11,First[#]]&/@Partition[Prime[Range[100]],2,1] (* _Harvey P. Dale_, Apr 04 2013 *) %Y A138680 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681. %K A138680 nonn %O A138680 2,2 %A A138680 _Artur Jasinski_, Mar 26 2008