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.

Showing 1-1 of 1 results.

A260298 Primes p such that hyperfactorial(p-1) == 1 (mod p).

Original entry on oeis.org

2, 3, 7, 47, 59, 79, 83, 103, 107, 127, 139, 191, 199, 211, 251, 263, 283, 307, 331, 367, 379, 383, 431, 467, 479, 499, 503, 547, 587, 599, 607, 631, 643, 659, 727, 743, 811, 823, 827, 839, 859, 863, 883, 887, 907, 971, 991, 1087, 1151, 1163, 1171, 1259, 1283
Offset: 1

Views

Author

Matthew Campbell, Jul 22 2015

Keywords

Comments

Does this contain 2 and the entries of A129518? - R. J. Mathar, Aug 07 2015
Primes p such that (p-1)!! == -1 (mod p). - Thomas Ordowski, Jul 26 2016

Crossrefs

Programs

  • Mathematica
    fQ[n_] := Mod[Hyperfactorial[n - 1], n] == 1; Select[ Prime@ Range@ 210, fQ] (* Robert G. Wilson v, Aug 06 2015 *)
  • PARI
    is(p)=prod(k=2, p-1, Mod(k, p)^k)==1 && isprime(p) \\ Charles R Greathouse IV, Aug 05 2015

Formula

a(n) = prime(A260299(n)).
Showing 1-1 of 1 results.