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

%I #14 Jan 28 2019 13:59:26

%S 1,2,4,8,16,32,64,128,77,154,129,79,158,137,95,11,22,44,88,176,173,

%T 167,155,131,83,166,153,127,75,150,121,63,126,73,146,113,47,94,9,18,

%U 36,72,144,109,39,78,156,133,87,174

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

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

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

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

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

%t PowerMod[2,Range[0,90],179] (* _Harvey P. Dale_, Jul 31 2018 *)

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

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

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_