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 A138672 #6 Apr 24 2017 16:59:06 %S A138672 1,2,3,1,8,12,8,7,9,8,30,27,8,21,28,4,8,33,64,8,70,64,50,67,64,8,64,8, %T A138672 64,32,64,85,8,27,8,65,59,64,49,43,8,95,8,64,8,136,40,64,8 %N A138672 Prime(n)^3 mod prime(n-1). %C A138672 Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4) %C A138672 prime(n) mod prime(n-1) is given in A001223 %C A138672 prime(n)^2 mod prime(n-1) is given in A038702 %C A138672 prime(n)^3 mod prime(n-1) is given in A138672 %C A138672 prime(n)^4 mod prime(n-1) is given in A138673 %C A138672 prime(n)^5 mod prime(n-1) is given in A138674 %C A138672 prime(n)^6 mod prime(n-1) is given in A138675 %C A138672 prime(n)^7 mod prime(n-1) is given in A138676 %C A138672 prime(n)^8 mod prime(n-1) is given in A138677 %C A138672 prime(n)^9 mod prime(n-1) is given in A138678 %C A138672 prime(n)^10 mod prime(n-1) is given in A138679 %C A138672 prime(n)^11 mod prime(n-1) is given in A138680 %C A138672 prime(n)^12 mod prime(n-1) is given in A138681 %H A138672 Harvey P. Dale, <a href="/A138672/b138672.txt">Table of n, a(n) for n = 0..1000</a> %e A138672 a(1)=1 because 3^3 = 27 = 1 mod 2 %e A138672 a(2)=2 because 5^3 = 125 = 2 mod 3 %t A138672 Table[Mod[Prime[n]^3, Prime[n - 1]], {n, 2, 50}] %t A138672 PowerMod[#[[2]], 3, #[[1]]] & /@ Partition[Prime[Range[50]], 2, 1] (* _Harvey P. Dale_, Apr 24 2017 *) %Y A138672 Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681. %K A138672 nonn %O A138672 0,2 %A A138672 _Artur Jasinski_, Mar 26 2008