|
%I #12 Jan 27 2019 10:57:46
%S 1,2,4,8,16,32,64,128,107,65,130,111,73,146,143,137,125,101,53,106,63,
%T 126,103,57,114,79,9,18,36,72,144,139,129,109,69,138,127,105,61,122,
%U 95,41,82,15,30,60,120,91,33
%N a(n) = 2^n mod 149.
%D I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H Muniru A Asiru, <a href="/A036147/b036147.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = a(n-148). - _Muniru A Asiru_, Jan 27 2019
%p [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%o (PARI) a(n)=lift(Mod(2,149)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o (GAP) a:=List([0..70],n->PowerMod(2,n,149));; Print(a); # _Muniru A Asiru_, Jan 27 2019
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_.
|
