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 A138679 #6 Apr 17 2014 19:42:00 %S A138679 1,1,4,4,1,9,4,4,4,9,25,33,40,21,18,13,21,48,26,30,57,9,12,78,6,14,36, %T A138679 61,105,85,64,113,65,6,130,38,138,160,152,81,129,142,69,7,39,157,171, %U A138679 30,116 %N A138679 Prime(n)^10 mod prime(n-1). %C A138679 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4) %C A138679 prime(n) mod prime(n-1) is given in A001223 %C A138679 prime(n)^2 mod prime(n-1) is given in A038702 %C A138679 prime(n)^3 mod prime(n-1) is given in A138672 %C A138679 prime(n)^4 mod prime(n-1) is given in A138673 %C A138679 prime(n)^5 mod prime(n-1) is given in A138674 %C A138679 prime(n)^6 mod prime(n-1) is given in A138675 %C A138679 prime(n)^7 mod prime(n-1) is given in A138676 %C A138679 prime(n)^8 mod prime(n-1) is given in A138677 %C A138679 prime(n)^9 mod prime(n-1) is given in A138678 %C A138679 prime(n)^10 mod prime(n-1) is given in A138679 %C A138679 prime(n)^11 mod prime(n-1) is given in A138680 %C A138679 prime(n)^12 mod prime(n-1) is given in A138681 %H A138679 Harvey P. Dale, <a href="/A138679/b138679.txt">Table of n, a(n) for n = 2..1000</a> %e A138679 a(1)=1 because 3^10 = 1 mod 2 %e A138679 a(2)=2 because 5^10 = 1 mod 3 %t A138679 Table[Mod[Prime[n]^10, Prime[n - 1]], {n, 2, 50}] %t A138679 PowerMod[Last[#],10,First[#]]&/@Partition[Prime[Range[50]],2,1] (* _Harvey P. Dale_, Apr 17 2014 *) %Y A138679 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681. %K A138679 nonn %O A138679 2,3 %A A138679 _Artur Jasinski_, Mar 26 2008