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.

A374919 Primes p such that -(p - 1)^p == p (mod 2*p - 1).

Original entry on oeis.org

2, 37, 97, 157, 229, 281, 337, 577, 601, 661, 829, 877, 937, 953, 997, 1009, 1069, 1237, 1297, 1429, 1609, 1657, 2017, 2029, 2089, 2137, 2221, 2281, 2341, 2557, 2617, 2731, 3037, 3061, 3109, 3169, 3181, 3301, 3529, 3697, 3709, 3769, 3877, 4177, 4241, 4261, 4357, 4621, 4801, 4861, 4909
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jul 23 2024

Keywords

Crossrefs

Cf. A374912.

Programs

  • Magma
    [p: p in PrimesUpTo(5000) | -(p-1)^p mod (2*p-1) eq p];
  • Mathematica
    Select[Prime[Range[700]], PowerMod[# - 1, #, 2*# - 1] == # - 1 &] (* Amiram Eldar, Jul 23 2024 *)