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.

A137327 Fermat(n) modulo n.

Original entry on oeis.org

0, 1, 2, 1, 2, 5, 5, 1, 5, 7, 4, 5, 10, 3, 2, 1, 2, 17, 5, 17, 5, 17, 4, 17, 22, 17, 14, 17, 17, 17, 9, 1, 5, 19, 12, 17, 34, 17, 23, 17, 38, 17, 5, 21, 32, 7, 22, 17, 5, 17, 2, 17, 43, 53, 37, 17, 29, 55, 21, 17, 58, 17, 5, 1, 62, 17, 22, 53, 65, 17, 13, 17
Offset: 1

Views

Author

Zerinvary Lajos, Apr 20 2008

Keywords

Comments

In the first 10000 terms, 17 appears 649 times and 257 appears 781 times. - T. D. Noe, Oct 01 2013

Crossrefs

Cf. A155836.

Programs

  • Maple
    with(numtheory):seq(irem(fermat(n),n),n=1..19);
    # second Maple program:
    a:= n-> (2&^(2^n) + 1) mod n:
    seq(a(n), n=1..100); # Alois P. Heinz, Sep 30 2013
  • Mathematica
    Table[Mod[PowerMod[2, 2^n, n] + 1, n], {n, 100}] (* T. D. Noe, Oct 01 2013 *)

Formula

a(n) = A000215(n) mod n.