The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036146 a(n) = 2^n mod 139. 3
 1, 2, 4, 8, 16, 32, 64, 128, 117, 95, 51, 102, 65, 130, 121, 103, 67, 134, 129, 119, 99, 59, 118, 97, 55, 110, 81, 23, 46, 92, 45, 90, 41, 82, 25, 50, 100, 61, 122, 105, 71, 3, 6, 12, 24, 48, 96, 53, 106, 73, 7, 14, 28 (list; graph; refs; listen; history; text; internal format)
 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-138). - Muniru A Asiru, Jan 27 2019 MAPLE [ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ]; MATHEMATICA PowerMod[2, Range[0, 100], 139] (* Harvey P. Dale, Dec 26 2017 *) PROG (PARI) a(n)=lift(Mod(2, 139)^n) \\ Charles R Greathouse IV, Mar 22 2016 (GAP) a:=List([0..70], n->PowerMod(2, n, 139));; Print(a); # Muniru A Asiru, Jan 27 2019 CROSSREFS Sequence in context: A036152 A036150 A036147 * A036144 A327368 A286660 Adjacent sequences:  A036143 A036144 A036145 * A036147 A036148 A036149 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 05:51 EDT 2020. Contains 337897 sequences. (Running on oeis4.)