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).

This page as a plain text file.
%I A374919 #11 Aug 12 2024 13:30:20
%S A374919 2,37,97,157,229,281,337,577,601,661,829,877,937,953,997,1009,1069,
%T A374919 1237,1297,1429,1609,1657,2017,2029,2089,2137,2221,2281,2341,2557,
%U A374919 2617,2731,3037,3061,3109,3169,3181,3301,3529,3697,3709,3769,3877,4177,4241,4261,4357,4621,4801,4861,4909
%N A374919 Primes p such that -(p - 1)^p == p (mod 2*p - 1).
%t A374919 Select[Prime[Range[700]], PowerMod[# - 1, #, 2*# - 1] == # - 1 &] (* _Amiram Eldar_, Jul 23 2024 *)
%o A374919 (Magma) [p: p in PrimesUpTo(5000) | -(p-1)^p mod (2*p-1) eq p];
%Y A374919 Cf. A374912.
%K A374919 nonn
%O A374919 1,1
%A A374919 _Juri-Stepan Gerasimov_, Jul 23 2024