cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A216126 a(n) = 5^n mod 10000.

Original entry on oeis.org

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
Offset: 0

Views

Author

V. Raman, Sep 01 2012

Keywords

Comments

Period = 4.

Crossrefs

Cf. A070370.

Programs

  • Mathematica
    PowerMod[5, Range[0, 100], 10^4] (* Paolo Xausa, Feb 19 2024 *)

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
Showing 1-1 of 1 results.