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!)
A216126 a(n) = 5^n mod 10000. 0
1, 5, 25, 125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625, 8125, 625, 3125, 5625 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Period = 4.
LINKS
FORMULA
a(n) = 625*A070370(n) for n>=4.
G.f.: (-8000*x^7-5600*x^6-3120*x^5-624*x^4-125*x^3-25*x^2-5*x-1)/(x^4-1). - Bruno Berselli, Sep 03 2012
MATHEMATICA
PowerMod[5, Range[0, 100], 10^4] (* Paolo Xausa, Feb 19 2024 *)
CROSSREFS
Cf. A070370.
Sequence in context: A132839 A206451 A291164 * A335506 A129066 A102169
KEYWORD
nonn,easy,less
AUTHOR
V. Raman, Sep 01 2012
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 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)