login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036154 a(n) = 2^n mod 181. 3
1, 2, 4, 8, 16, 32, 64, 128, 75, 150, 119, 57, 114, 47, 94, 7, 14, 28, 56, 112, 43, 86, 172, 163, 145, 109, 37, 74, 148, 115, 49, 98, 15, 30, 60, 120, 59, 118, 55, 110, 39, 78, 156, 131, 81, 162, 143, 105, 29, 58, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
LINKS
FORMULA
a(n) = a(n-180). - 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, 181)^n) \\ Charles R Greathouse IV, Mar 22 2016
(GAP) a:=List([0..70], n->PowerMod(2, n, 181));; Print(a); # Muniru A Asiru, Jan 26 2019
CROSSREFS
Sequence in context: A036161 A036159 A036157 * A036153 A036152 A036150
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 1 19:12 EDT 2024. Contains 374818 sequences. (Running on oeis4.)