A036147 a(n) = 2^n mod 149.

1, 2, 4, 8, 16, 32, 64, 128, 107, 65, 130, 111, 73, 146, 143, 137, 125, 101, 53, 106, 63, 126, 103, 57, 114, 79, 9, 18, 36, 72, 144, 139, 129, 109, 69, 138, 127, 105, 61, 122, 95, 41, 82, 15, 30, 60, 120, 91, 33

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-148). - Muniru A Asiru, Jan 27 2019

Maple

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

Prog

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

Crossrefs

Sequence in context: A036153 A036152 A036150 * A036146 A036144 A327368

Adjacent sequences: A036144 A036145 A036146 * A036148 A036149 A036150

Keyword

nonn,easy

Author

N. J. A. Sloane.

Status

approved