|
%I #12 Jan 28 2019 14:00:07
%S 1,2,4,8,16,32,64,128,117,95,51,102,65,130,121,103,67,134,129,119,99,
%T 59,118,97,55,110,81,23,46,92,45,90,41,82,25,50,100,61,122,105,71,3,6,
%U 12,24,48,96,53,106,73,7,14,28
%N a(n) = 2^n mod 139.
%D I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H Muniru A Asiru, <a href="/A036146/b036146.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = a(n-138). - _Muniru A Asiru_, Jan 27 2019
%p [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%t PowerMod[2,Range[0,100],139] (* _Harvey P. Dale_, Dec 26 2017 *)
%o (PARI) a(n)=lift(Mod(2,139)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o (GAP) a:=List([0..70],n->PowerMod(2,n,139));; Print(a); # _Muniru A Asiru_, Jan 27 2019
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_.
|
