login
A036144
a(n) = 2^n mod 131.
3
1, 2, 4, 8, 16, 32, 64, 128, 125, 119, 107, 83, 35, 70, 9, 18, 36, 72, 13, 26, 52, 104, 77, 23, 46, 92, 53, 106, 81, 31, 62, 124, 117, 103, 75, 19, 38, 76, 21, 42, 84, 37, 74, 17, 34, 68, 5, 10, 20, 40, 80, 29, 58, 116
OFFSET
0,2
REFERENCES
I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
LINKS
FORMULA
a(n) = a(n-130). - 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, 131)^n) \\ Charles R Greathouse IV, Mar 22 2016
(GAP) a:=List([0..70], n->PowerMod(2, n, 131));; Print(a); # Muniru A Asiru, Jan 27 2019
CROSSREFS
Sequence in context: A036150 A036147 A036146 * A327368 A286660 A009641
KEYWORD
nonn,easy
STATUS
approved