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!)
A036133 a(n) = 5^n mod 73. 3
1, 5, 25, 52, 41, 59, 3, 15, 2, 10, 50, 31, 9, 45, 6, 30, 4, 20, 27, 62, 18, 17, 12, 60, 8, 40, 54, 51, 36, 34, 24, 47, 16, 7, 35, 29, 72, 68, 48, 21, 32, 14, 70, 58, 71, 63, 23, 42, 64, 28, 67, 43, 69, 53, 46, 11, 55, 56 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
LINKS
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-1,1).
FORMULA
From G. C. Greubel, Oct 17 2018: (Start)
a(n) = a(n-1) - a(n-36) + a(n-37).
a(n+72) = a(n). (End)
MAPLE
[ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];
MATHEMATICA
PowerMod[5, Range[0, 60], 73] (* Harvey P. Dale, Dec 24 2011 *)
PROG
(PARI) a(n)=lift(Mod(5, 73)^n) \\ Charles R Greathouse IV, Mar 22 2016
(Magma) [Modexp(5, n, 73): n in [0..100]]; // G. C. Greubel, Oct 17 2018
(Python) for n in range(0, 100): print(int(pow(5, n, 73)), end=' ') # Stefano Spezia, Oct 17 2018
(GAP) List([0..60], n->PowerMod(5, n, 73)); # Muniru A Asiru, Oct 17 2018
CROSSREFS
Cf. A000351 (5^n).
Sequence in context: A101654 A043106 A147184 * A062671 A225494 A139479
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 July 22 13:50 EDT 2024. Contains 374499 sequences. (Running on oeis4.)