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!)
A036139 a(n) = 5^n mod 103. 3
1, 5, 25, 22, 7, 35, 72, 51, 49, 39, 92, 48, 34, 67, 26, 27, 32, 57, 79, 86, 18, 90, 38, 87, 23, 12, 60, 94, 58, 84, 8, 40, 97, 73, 56, 74, 61, 99, 83, 3, 15, 75, 66, 21, 2, 10, 50, 44, 14, 70, 41, 102, 98, 78, 81, 96, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

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, 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-51) + a(n-52).

a(n+102) = a(n). (End)

MAPLE

[ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];

MATHEMATICA

PowerMod[5, Range[0, 100], 103] (* G. C. Greubel, Oct 17 2018 *)

PROG

(MAGMA) [Modexp(5, n, 103): n in [0..100]]; // Vincenzo Librandi, Sep 13 2011

(PARI) a(n)=lift(Mod(5, 103)^n) \\ Charles R Greathouse IV, Mar 22 2016

(GAP) List([0..60], n->PowerMod(5, n, 103)); # Muniru A Asiru, Oct 17 2018

CROSSREFS

Cf. A000351 (5^n).

Sequence in context: A070383 A070061 A070376 * A070382 A271379 A192493

Adjacent sequences:  A036136 A036137 A036138 * A036140 A036141 A036142

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 July 14 19:48 EDT 2020. Contains 335729 sequences. (Running on oeis4.)