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.

A297967 a(n) = 5^n mod prime(n).

Original entry on oeis.org

1, 1, 0, 2, 1, 12, 10, 4, 11, 20, 25, 10, 39, 36, 41, 13, 36, 58, 52, 1, 17, 26, 19, 64, 13, 5, 94, 14, 25, 36, 40, 74, 117, 81, 6, 123, 24, 155, 134, 117, 20, 42, 69, 36, 185, 111, 121, 16, 206, 159, 42, 220, 47, 123, 130, 61, 57, 83, 6, 79, 270, 14, 91
Offset: 1

Views

Author

Vincenzo Librandi, Jan 15 2018

Keywords

Crossrefs

Programs

  • Magma
    [Modexp(5, n, NthPrime(n)): n in [1..80]];
  • Mathematica
    Array[PowerMod[5, #, Prime@#]&, 80]

Formula

a(n) = A000351(n) mod A000040(n).
Showing 1-1 of 1 results.