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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (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-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

Adjacent sequences:  A036141 A036142 A036143 * A036145 A036146 A036147

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 30 22:57 EDT 2020. Contains 338095 sequences. (Running on oeis4.)