|
%I #12 Jan 28 2019 13:59:49
%S 1,2,4,8,16,32,64,128,125,119,107,83,35,70,9,18,36,72,13,26,52,104,77,
%T 23,46,92,53,106,81,31,62,124,117,103,75,19,38,76,21,42,84,37,74,17,
%U 34,68,5,10,20,40,80,29,58,116
%N a(n) = 2^n mod 131.
%D I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H Muniru A Asiru, <a href="/A036144/b036144.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = a(n-130). - _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,131)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o (GAP) a:=List([0..70],n->PowerMod(2,n,131));; Print(a); # _Muniru A Asiru_, Jan 27 2019
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
