login
A036161
a(n) = 2^n mod 227.
3
1, 2, 4, 8, 16, 32, 64, 128, 29, 58, 116, 5, 10, 20, 40, 80, 160, 93, 186, 145, 63, 126, 25, 50, 100, 200, 173, 119, 11, 22, 44, 88, 176, 125, 23, 46, 92, 184, 141, 55, 110, 220, 213, 199, 171, 115, 3, 6, 12, 24, 48, 96, 192, 157, 87, 174, 121, 15, 30, 60, 120, 13, 26, 52, 104, 208
OFFSET
0,2
REFERENCES
I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
LINKS
FORMULA
a(n) = a(n-226). - Muniru A Asiru, Jan 27 2019
MAPLE
i := pi(227) ; [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];
PROG
(PARI) a(n)=lift(Mod(2, 227)^n) \\ Charles R Greathouse IV, Mar 22 2016
(Magma) [Modexp(2, n, 227): n in [0..80]]; // Vincenzo Librandi, Oct 19 2018
(GAP) a:=List([0..70], n->PowerMod(2, n, 227));; Print(a); # Muniru A Asiru, Jan 26 2019
CROSSREFS
Cf. A000079 (2^n).
Sequence in context: A047869 A270201 A016025 * A036159 A036157 A036154
KEYWORD
nonn,easy
STATUS
approved