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!)
A036147 a(n) = 2^n mod 149. 3
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 (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-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
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 March 28 08:00 EDT 2024. Contains 371235 sequences. (Running on oeis4.)