cp's OEIS Frontend

A036161 a(n) = 2^n mod 227.

%I A036161 #31 Sep 08 2022 08:44:52
%S A036161 1,2,4,8,16,32,64,128,29,58,116,5,10,20,40,80,160,93,186,145,63,126,
%T A036161 25,50,100,200,173,119,11,22,44,88,176,125,23,46,92,184,141,55,110,
%U A036161 220,213,199,171,115,3,6,12,24,48,96,192,157,87,174,121,15,30,60,120,13,26,52,104,208
%N A036161 a(n) = 2^n mod 227.
%D A036161 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H A036161 Muniru A Asiru, <a href="/A036161/b036161.txt">Table of n, a(n) for n = 0..1000</a>
%F A036161 a(n) = a(n-226). - _Muniru A Asiru_, Jan 27 2019
%p A036161 i := pi(227) ; [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%o A036161 (PARI) a(n)=lift(Mod(2,227)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o A036161 (Magma) [Modexp(2, n, 227): n in [0..80]]; // _Vincenzo Librandi_, Oct 19 2018
%o A036161 (GAP) a:=List([0..70],n->PowerMod(2,n,227));; Print(a); # _Muniru A Asiru_, Jan 26 2019
%Y A036161 Cf. A000079 (2^n).
%K A036161 nonn,easy
%O A036161 0,2
%A A036161 _N. J. A. Sloane_