A036150 a(n) = 2^n mod 163.

1, 2, 4, 8, 16, 32, 64, 128, 93, 23, 46, 92, 21, 42, 84, 5, 10, 20, 40, 80, 160, 157, 151, 139, 115, 67, 134, 105, 47, 94, 25, 50, 100, 37, 74, 148, 133, 103, 43, 86, 9, 18, 36, 72, 144, 125, 87, 11, 22, 44, 88, 13, 26, 52, 104, 45, 90, 17, 34, 68, 136, 109, 55, 110, 57, 114

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,163));; 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,70],163] (* Harvey P. Dale, Aug 30 2021 *)

PARI

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

Formula

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