|
%I #11 Oct 28 2017 10:50:17
%S 0,1,1,1,3,1,6,1,1,9,2,1,0,1,7,1,13,1,13,1,13,15,13,1,18,13,1,1,13,19,
%T 13,1,19,33,27,1,13,17,13,1,13,1,13,5,28,31,13,1,48,49,4,13,13,1,32,1,
%U 31,53,13,1,13,45,55,1,13,31,13,1,58,29,13,1,13,21,7
%N a(n) = 13^n modulo n.
%H Paul Tek, <a href="/A116609/b116609.txt">Table of n, a(n) for n = 1..10000</a>
%e a(5)=3 because 13^5 = 371293 = 3 mod 5.
%t Table[PowerMod[13,k,k],{k,200}]
%o (PARI) for(n=1, 50, print1(lift(Mod(13^n, n)), ", ")) \\ _G. C. Greubel_, Oct 28 2017
%K nonn
%O 1,5
%A _Zak Seidov_, Feb 19 2006
|
