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-2 of 2 results.

A067999 Numbers k such that (k! - 1) == 0 (mod prime(k)).

Original entry on oeis.org

1, 3, 10, 149, 437
Offset: 1

Views

Author

Robert G. Wilson v, Feb 08 2002

Keywords

Comments

There are no more terms through 5000000. - Ryan Propper, Dec 30 2007
Numbers k such that A091858(k) = 1. - Zak Seidov, Oct 05 2012

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{k = p = 1, m = Prime[n]}, While[p = Mod[p k, m]; k < n, k++ ]; p]; Do[ If[ f[n] == 1, Print[n]], {n, 100000}] (* Robert G. Wilson v, Mar 16 2004 *)

A066953 Integers of the form (k!+1)/prime(k).

Original entry on oeis.org

1, 1, 11, 104956945995541, 6458007542034006723505363870885661685813595082173513446600259282126155549185667752443
Offset: 1

Views

Author

Benoit Cloitre, Feb 01 2002

Keywords

Comments

The next term has more than 6.5*10^7 digits, if it exists. - Amiram Eldar, Apr 22 2025

Crossrefs

Cf. A068000.

Programs

  • Mathematica
    f[k_] := (k! + 1)/Prime[k]; f /@ Select[Range[100], IntegerQ[f[#]] &] (* Amiram Eldar, Apr 22 2025 *)
  • PARI
    list(lim) = {my(k = 0, r = 1); forprime(p = 1, lim, k++; r *= k; if(!((r+1) % p), print1((r+1)/p, ", ")));} \\ Amiram Eldar, Apr 22 2025

Formula

a(n) = (A068000(n)!+1)/prime(A068000(n)). - Amiram Eldar, Apr 22 2025
Showing 1-2 of 2 results.