login
a(n) = 2^n mod 163.
3

%I #21 Aug 30 2021 13:56:22

%S 1,2,4,8,16,32,64,128,93,23,46,92,21,42,84,5,10,20,40,80,160,157,151,

%T 139,115,67,134,105,47,94,25,50,100,37,74,148,133,103,43,86,9,18,36,

%U 72,144,125,87,11,22,44,88,13,26,52,104,45,90,17,34,68,136,109,55,110,57,114

%N a(n) = 2^n mod 163.

%D I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.

%H Muniru A Asiru, <a href="/A036150/b036150.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = a(n-162). - _Muniru A Asiru_, Jan 27 2019

%p [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];

%t PowerMod[2,Range[0,70],163] (* _Harvey P. Dale_, Aug 30 2021 *)

%o (PARI) a(n)=lift(Mod(2,163)^n) \\ _Charles R Greathouse IV_, Mar 22 2016

%o (GAP) a:=List([0..70],n->PowerMod(2,n,163));; Print(a); # _Muniru A Asiru_, Jan 27 2019

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_