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.

A383485 a(n) = 2*(2*(n - 1)! + n + 2) (mod n*(n + 2)).

Original entry on oeis.org

1, 4, 3, 12, 5, 16, 0, 20, 31, 24, 11, 28, 0, 32, 49, 36, 17, 40, 0, 44, 67, 48, 0, 52, 54, 56, 85, 60, 29, 64, 0, 68, 70, 72, 109, 76, 0, 80, 121, 84, 41, 88, 0, 92, 139, 96, 0, 100, 102, 104, 157, 108, 0, 112, 114, 116, 175, 120, 59, 124, 0, 128, 130, 132, 199, 136, 0, 140
Offset: 1

Views

Author

Giorgos Kalogeropoulos, Apr 28 2025

Keywords

Comments

Fixed points are the lesser of twin primes A001359.
Positions of zeros are primes p such that p + 2 is not a prime A067774.

Crossrefs

Programs

  • Mathematica
    Table[Mod[2(2(n - 1)! + n + 2), n(n + 2)], {n, 68}]

Formula

a(A001359(n)) = n.
a(A067774(n)) = 0.