A036146 a(n) = 2^n mod 139.

1, 2, 4, 8, 16, 32, 64, 128, 117, 95, 51, 102, 65, 130, 121, 103, 67, 134, 129, 119, 99, 59, 118, 97, 55, 110, 81, 23, 46, 92, 45, 90, 41, 82, 25, 50, 100, 61, 122, 105, 71, 3, 6, 12, 24, 48, 96, 53, 106, 73, 7, 14, 28

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

References

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

Links

• Muniru A Asiru, Table of n, a(n) for n = 0..1000

Programs

GAP

a:=List([0..70],n->PowerMod(2,n,139));; Print(a); # Muniru A Asiru, Jan 27 2019

Maple

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

Mathematica

PowerMod[2,Range[0,100],139] (* Harvey P. Dale, Dec 26 2017 *)

PARI

a(n)=lift(Mod(2,139)^n) \\ Charles R Greathouse IV, Mar 22 2016

Formula

a(n) = a(n-138). - Muniru A Asiru, Jan 27 2019