A036152 a(n) = 2^n mod 173.

1, 2, 4, 8, 16, 32, 64, 128, 83, 166, 159, 145, 117, 61, 122, 71, 142, 111, 49, 98, 23, 46, 92, 11, 22, 44, 88, 3, 6, 12, 24, 48, 96, 19, 38, 76, 152, 131, 89, 5, 10, 20, 40, 80, 160, 147, 121, 69, 138, 103, 33, 66, 132, 91, 9, 18, 36, 72, 144, 115, 57, 114, 55, 110, 47, 94

Offset

0,2

References

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

Links

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

Formula

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

Maple

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

Mathematica

PowerMod[2, Range[0, 80], 173]  (* Harvey P. Dale, Mar 22 2011 *)

Prog

(PARI) a(n)=lift(Mod(2, 173)^n) \\ Charles R Greathouse IV, Mar 22 2016
(GAP) a:=List([0..70], n->PowerMod(2, n, 173));; Print(a); # Muniru A Asiru, Jan 27 2019

Crossrefs

Sequence in context: A036157 A036154 A036153 * A036150 A036147 A036146

Adjacent sequences: A036149 A036150 A036151 * A036153 A036154 A036155

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved