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.

A085146 Numbers k such that k!!!! + 1 is prime.

Original entry on oeis.org

0, 1, 2, 4, 6, 18, 38, 56, 94, 118, 148, 286, 1358, 1480, 1514, 2680, 2846, 4078, 4288, 5612, 5680, 6440, 6586, 14614, 30972, 31690, 54406
Offset: 1

Views

Author

Hugo Pfoertner, Jun 25 2003

Keywords

Comments

The search for multifactorial primes started by Ray Ballinger is now continued by a team of volunteers on the website of Ken Davis (see link).

Crossrefs

Cf. A007662 (quadruple factorials), A085147.

Extensions

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 03 2008

A156167 Numbers n such that n![7]-1 is prime (where n![7] = A114799(n) = septuple factorial).

Original entry on oeis.org

3, 4, 6, 8, 9, 10, 11, 12, 14, 17, 20, 24, 30, 31, 32, 46, 52, 54, 59, 98, 104, 143, 145, 160, 174, 198, 199, 202, 212, 215, 254, 371, 382, 452, 674, 739, 959, 1249, 1657, 2291, 2553, 2650, 3562, 3727, 3853, 4389, 4604, 5449, 5659, 6026, 6878, 7900, 9564, 10150, 12444, 13321, 22642, 24014, 26598, 27430, 31386, 40707, 43328, 45811
Offset: 1

Views

Author

M. F. Hasler, Feb 10 2009

Keywords

Comments

a(65) > 50000. - Robert Price, Sep 09 2012

Crossrefs

Programs

  • Mathematica
    MultiFactorial[n_, k_] := If[n < 1, 1, n*MultiFactorial[n - k, k]];
    Select[Range[0, 1000], PrimeQ[MultiFactorial[#, 7] - 1] & ] (* Robert Price, Apr 19 2019 *)
  • PARI
    mf(n,k=7)=prod(i=0,(n-2)\k,n-i*k)
    for( n=1,9999, ispseudoprime(mf(n)-1) & print1(n","))

Extensions

a(43)-a(64) from Robert Price, Sep 09 2012
Showing 1-2 of 2 results.