|
%I #19 Jan 27 2019 07:55:14
%S 1,2,4,8,16,32,64,128,59,118,39,78,156,115,33,66,132,67,134,71,142,87,
%T 174,151,105,13,26,52,104,11,22,44,88,176,155,113,29,58,116,35,70,140,
%U 83,166,135,73,146,95,190,183
%N a(n) = 2^n mod 197.
%D I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H Muniru A Asiru, <a href="/A036157/b036157.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = a(n-196). - _Muniru A Asiru_, Jan 27 2019
%p [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%t Table[PowerMod[2,n,197],{n,0,50}] (* _Harvey P. Dale_, Jan 11 2011 *)
%o (PARI) a(n)=lift(Mod(2,197)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o (GAP) a:=List([0..70],n->PowerMod(2,n,197));; Print(a); # _Muniru A Asiru_, Jan 26 2019
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
