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.

A290139 a(n) = A225984(n) mod n.

Original entry on oeis.org

0, 1, 2, 3, 4, 3, 6, 3, 2, 8, 10, 5, 12, 3, 8, 3, 16, 6, 18, 6, 0, 14, 22, 9, 9, 16, 11, 11, 28, 18, 30, 3, 26, 3, 33, 2, 36, 3, 6, 34, 40, 26, 42, 0, 2, 26, 46, 17, 41, 43, 27, 24, 52, 42, 28, 43, 12, 32, 58, 26, 60, 3, 60, 3, 23, 11, 66, 45, 62, 17, 70, 42, 72, 3
Offset: 1

Views

Author

Seiichi Manyama, Jul 21 2017

Keywords

Crossrefs

Programs

  • Mathematica
    MapIndexed[Mod[#1, First@ #2] &, LinearRecurrence[{-1, 1, -1, 0, 1}, {-1, 3, -7, 11, -16}, 74]] (* Michael De Vlieger, Jul 21 2017, after T. D. Noe at A225984 *)

Formula

a(p) = p - 1 for all prime p.