A006794 -id:A006794 - cp's OEIS frontend

A002110 Primorial numbers (first definition): product of first n primes. Sometimes written prime(n)#.

1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810, 304250263527210, 13082761331670030, 614889782588491410, 32589158477190044730, 1922760350154212639070, 117288381359406970983270, 7858321551080267055879090

Offset: 0

N. J. A. Sloane and J. H. Conway

See A034386 for the second definition of primorial numbers: product of primes in the range 2 to n.
a(n) is the least number N with n distinct prime factors (i.e., omega(N) = n, cf. A001221). - Lekraj Beedassy, Feb 15 2002
Phi(n)/n is a new minimum for each primorial. - Robert G. Wilson v, Jan 10 2004
Smallest number stroked off n times after the n-th sifting process in an Eratosthenes sieve. - Lekraj Beedassy, Mar 31 2005
Apparently each term is a new minimum for phi(x)*sigma(x)/x^2. 6/Pi^2 < sigma(x)*phi(x)/x^2 < 1 for n > 1. - Jud McCranie, Jun 11 2005
Let f be a multiplicative function with f(p) > f(p^k) > 1 (p prime, k > 1), f(p) > f(q) > 1 (p, q prime, p < q). Then the record maxima of f occur at n# for n >= 1. Similarly, if 0 < f(p) < f(p^k) < 1 (p prime, k > 1), 0 < f(p) < f(q) < 1 (p, q prime, p < q), then the record minima of f occur at n# for n >= 1. - David W. Wilson, Oct 23 2006
Wolfe and Hirshberg give ?, ?, ?, ?, ?, 30030, ?, ... as a puzzle.
Records in number of distinct prime divisors. - Artur Jasinski, Apr 06 2008
For n >= 2, the digital roots of a(n) are multiples of 3. - Parthasarathy Nambi, Aug 19 2009 [with corrections by Zak Seidov, Aug 30 2015]
Denominators of the sum of the ratios of consecutive primes (see A094661). - Vladimir Joseph Stephan Orlovsky, Oct 24 2009
Where record values occur in A001221. - Melinda Trang (mewithlinda(AT)yahoo.com), Apr 15 2010
It can be proved that there are at least T prime numbers less than N, where the recursive function T is: T = N - N*Sum_{i = 0..T(sqrt(N))} A005867(i)/A002110(i). This can show for example that at least 0.16*N numbers are primes less than N for 29^2 > N > 23^2. - Ben Paul Thurston, Aug 23 2010
The above comment from Parthasarathy Nambi follows from the observation that digit summing produces a congruent number mod 9, so the digital root of any multiple of 3 is a multiple of 3. prime(n)# is divisible by 3 for n >= 2. - Christian Schulz, Oct 30 2013
The peaks (i.e., local maximums) in a graph of the number of repetitions (i.e., the tally of values) vs. value, as generated by taking the differences of all distinct pairs of odd prime numbers within a contiguous range occur at regular periodic intervals given by the primorial numbers 6 and greater. Larger primorials yield larger (relative) peaks, however the range must be >50% larger than the primorial to be easily observed. Secondary peaks occur at intervals of those "near-primorials" divisible by 6 (e.g., 42). See A259629. Also, periodicity at intervals of 6 and 30 can be observed in the local peaks of all possible sums of two, three or more distinct odd primes within modest contiguous ranges starting from p(2) = 3. - Richard R. Forberg, Jul 01 2015
If a number k and a(n) are coprime and k < (prime(n+1))^b < a(n), where b is an integer, then k has fewer than b prime factors, counting multiplicity (i.e., bigomega(k) < b, cf. A001222). - Isaac Saffold, Dec 03 2017
If n > 0, then a(n) has 2^n unitary divisors (A034444), and a(n) is a record; i.e., if k < a(n) then k has fewer unitary divisors than a(n) has. - Clark Kimberling, Jun 26 2018
Unitary superabundant numbers: numbers k with a record value of the unitary abundancy index, A034448(k)/k > A034448(m)/m for all m < k. - Amiram Eldar, Apr 20 2019
Psi(n)/n is a new maximum for each primorial (psi = A001615) [proof in link: Patrick Sole and Michel Planat, proposition 1 page 2]; compare with comment 2004: Phi(n)/n is a new minimum for each primorial. - Bernard Schott, May 21 2020
The term "primorial" was coined by Harvey Dubner (1987). - Amiram Eldar, Apr 16 2021
a(n)^(1/n) is approximately (n log n)/e. - Charles R Greathouse IV, Jan 03 2023
Subsequence of A267124. - Frank M Jackson, Apr 14 2023

			a(9) = 23# = 2*3*5*7*11*13*17*19*23 = 223092870 divides the difference 5283234035979900 in the arithmetic progression of 26 primes A204189. - _Jonathan Sondow_, Jan 15 2012

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 50.
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, Cambridge, University Press, 1940, p. 49.
P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 4.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 114.
D. Wolfe and S. Hirshberg, Underspecified puzzles, in Tribute to A Mathemagician, Peters, 2005, pp. 73-74.

Alex Ermolaev, Table of n, a(n) for n = 0..350 (terms up to a(100) from T. D. Noe)
Iskander Aliev, Jesús De Loera, Fritz Eisenbrand, Timm Oertel, and Robert Weismantel, The Support of Integer Optimal Solutions, arXiv:1712.08923 [math.OC], 2017.
C. K. Caldwell, The Prime Glossary, Primorial.
Geoffrey Caveney, J.-L. Nicolas and J. Sondow, On SA, CA, and GA numbers, arXiv:1112.6010 [math.NT], 2011-2012; Ramanujan J., 29 (2012), 359-384.
Harvey Dubner, Factorial and primorial primes, J. Rec. Math., Vol. 19, No. 3 (1987), pp. 197-203. (Annotated scanned copy)
F. Ellermann, Illustration for A002110, A005867, A038110, A060753.
S. W. Golomb, The evidence for Fortune's conjecture, Math. Mag. 54 (1981), 209-210.
D. J. Greenhoe, MRA-Wavelet subspace architecture for logic, probability, and symbolic sequence processing, 2014.
Daniel J. Greenhoe, Frames and Bases: Structure and Design, Version 0.20, Signal Processing ABCs series (2019) Vol. 4, pp. 7, 81.
Daniel J. Greenhoe, A Book Concerning Transforms, Version 0.10, Signal Processing ABCs series (2019) Vol. 5, see page 7.
A. W. Lin and S. Zhou, A linear-time algorithm for the orbit problem over cyclic groups, preprint, CONCUR 2014 - Concurrency Theory, Volume 8704 of the series Lecture Notes in Computer Science pp. 327-341.
A. W. Lin and S. Zhou, A linear-time algorithm for the orbit problem over cyclic groups, CONCUR 2014 - Concurrency Theory, Lecture Notes in Computer Science, Volume 8704, 2014, pp. 327-341.
F. E. Masat, Letter to N. J. A. Sloane with attachment: "A note on prime number sequences" (unpublished manuscript), Apr. 1991.
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv:1202.3670 [math.HO], 2012.
Thomas Morrill, Further Development of "Non-Pythagorean" Musical Scales Based on Logarithms, arXiv:1804.08067 [math.HO], 2018.
J.-L. Nicolas, Petites valeurs de la fonction d'Euler, J. Number Theory 17, no.3 (1983), 375-388.
Patrick Sole and Michel Planat, The Robin inequality for 7-free integers, INTEGERS, 2011, #A65.
Andrew V. Sutherland, Order Computations in Generic Groups, Ph. D. Dissertation, Math. Dept., M.I.T., 2007.
G. Villemin's Almanach of Numbers, Primorielle.
Eric Weisstein's World of Mathematics, Primorial.
Robert G. Wilson v, Letter to N. J. A. Sloane, Jan. 1994.
Index to divisibility sequences
Index entries for "core" sequences
Index entries for sequences related to primorial base
Index entries for sequences related to primorial numbers

A034386 gives the second version of the primorial numbers.
Subsequence of A005117 and of A064807. Apart from the first term, a subsequence of A083207.
Cf. A001615, A002182, A002201, A003418, A005235, A006862, A034444 (unitary divisors), A034448, A034387, A033188, A035345, A035346, A036691 (compositorial numbers), A049345 (primorial base representation), A057588, A060735 (and integer multiples), A061742 (squares), A072938, A079266, A087315, A094348, A106037, A121572, A053589, A064648, A132120, A260188.
Cf. A061720 (first differences), A143293 (partial sums).
Cf. also A276085, A276086.
The following fractions are all related to each other: Sum 1/n: A001008/A002805, Sum 1/prime(n): A024451/A002110 and A106830/A034386, Sum 1/nonprime(n): A282511/A282512, Sum 1/composite(n): A250133/A296358.

a002110 n = product $ take n a000040_list
a002110_list = scanl (*) 1 a000040_list
-- Reinhard Zumkeller, Feb 19 2012, May 03 2011

[1] cat [&*[NthPrime(i): i in [1..n]]: n in [1..20]]; // Bruno Berselli, Oct 24 2012

[1] cat [&*PrimesUpTo(p): p in PrimesUpTo(60)]; // Bruno Berselli, Feb 08 2015

A002110 := n -> mul(ithprime(i),i=1..n);

FoldList[Times, 1, Prime[Range[20]]]
primorial[n_] := Product[Prime[i], {i, n}]; Array[primorial,20] (* José María Grau Ribas, Feb 15 2010 *)
Join[{1}, Denominator[Accumulate[1/Prime[Range[20]]]]] (* Harvey P. Dale, Apr 11 2012 *)

a(n)=prod(i=1,n, prime(i)) \\ Washington Bomfim, Sep 23 2008

p=1; for (n=0, 100, if (n, p*=prime(n)); write("b002110.txt", n, " ", p) )  \\ Harry J. Smith, Nov 13 2009

a(n) = factorback(primes(n)) \\ David A. Corneth, May 06 2018

from sympy import primorial
def a(n): return 1 if n < 1 else primorial(n)
[a(n) for n in range(51)]  # Indranil Ghosh, Mar 29 2017

[sloane.A002110(n) for n in (1..20)] # Giuseppe Coppoletta, Dec 05 2014

; with memoization-macro definec
(definec (A002110 n) (if (zero? n) 1 (* (A000040 n) (A002110 (- n 1))))) ;; Antti Karttunen, Aug 30 2016

Asymptotic expression for a(n): exp((1 + o(1)) * n * log(n)) where o(1) is the "little o" notation. - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Apr 08 2001
a(n) = A054842(A002275(n)).
Binomial transform = A136104: (1, 3, 11, 55, 375, 3731, ...). Equals binomial transform of A121572: (1, 1, 3, 17, 119, 1509, ...). - Gary W. Adamson, Dec 14 2007
a(0) = 1, a(n+1) = prime(n)*a(n). - Juri-Stepan Gerasimov, Oct 15 2010
a(n) = Product_{i=1..n} A000040(i). - Jonathan Vos Post, Jul 17 2008
a(A051838(n)) = A116536(n) * A007504(A051838(n)). - Reinhard Zumkeller, Oct 03 2011
A000005(a(n)) = 2^n. - Carlos Eduardo Olivieri, Jun 16 2015
a(n) = A035345(n) - A005235(n) for n > 0. - Jonathan Sondow, Dec 02 2015
For all n >= 0, a(n) = A276085(A000040(n+1)), a(n+1) = A276086(A143293(n)). - Antti Karttunen, Aug 30 2016
A054841(a(n)) = A002275(n). - Michael De Vlieger, Aug 31 2016
a(n) = A270592(2*n+2) - A270592(2*n+1) if 0 <= n <= 4 (conjectured for all n by Alon Kellner). - Jonathan Sondow, Mar 25 2018
Sum_{n>=1} 1/a(n) = A064648. - Amiram Eldar, Oct 16 2020
Sum_{n>=1} (-1)^(n+1)/a(n) = A132120. - Amiram Eldar, Apr 12 2021
Theta being Chebyshev's theta function, a(0) = exp(theta(1)), and for n > 0, a(n) = exp(theta(m)) for A000040(n) <= m < A000040(n+1) where m is an integer. - Miles Englezou, Nov 26 2024

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

Original entry on oeis.org

0, 1, 2, 3, 11, 27, 37, 41, 73, 77, 116, 154, 320, 340, 399, 427, 872, 1477, 6380, 26951, 110059, 150209, 288465, 308084, 422429

Offset: 1

N. J. A. Sloane

If n + 1 is prime then (by Wilson's theorem) n + 1 divides n! + 1. Thus for n > 2 if n + 1 is prime n is not in the sequence. - Farideh Firoozbakht, Aug 22 2003
For n > 2, n! + 1 is prime <==> nextprime((n+1)!) > (n+1)nextprime(n!) and we can conjecture that for n > 2 if n! + 1 is prime then (n+1)! + 1 is not prime. - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 03 2004
The prime members are in A093804 (numbers n such that Sum_{d|n} d! is prime) since Sum_{d|n} d! = n! + 1 if n is prime. - Jonathan Sondow
150209 is also in the sequence, cf. the link to Caldwell's prime pages. - M. F. Hasler, Nov 04 2011

			3! + 1 = 7 is prime, so 3 is in the sequence.

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 116, p. 40, Ellipses, Paris 2008.
Harvey Dubner, Factorial and primorial primes, J. Rec. Math., 19 (No. 3, 1987), 197-203.
Richard K. Guy, Unsolved Problems in Number Theory, Section A2.
F. Le Lionnais, Les Nombres Remarquables, Paris, Hermann, 1983, p. 100.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 118.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 70.

A. Borning, Some results for k!+-1 and 2.3.5...p+-1, Math. Comp., 26 (1972), 567-570.
Chris K. Caldwell, Factorial Primes.
Chris K. Caldwell, 110059! + 1 on the Prime Pages.
Chris K. Caldwell, 150209! + 1 on the Prime Pages (Oct 31, 2011).
Chris K. Caldwell, 288465! + 1 on the Prime Pages (Jan 12, 2022).
Chris K. Caldwell and Y. Gallot, On the primality of n!+-1 and 2*3*5*...*p+-1, Math. Comp., 71 (2001), 441-448.
Antonín Čejchan, Michal Křížek, and Lawrence Somer, On Remarkable Properties of Primes Near Factorials and Primorials, Journal of Integer Sequences, Vol. 25 (2022), Article 22.1.4.
H. Dubner, Factorial and primorial primes, J. Rec. Math., 19 (No. 3, 1987), 197-203. (Annotated scanned copy)
H. Dubner and N. J. A. Sloane, Correspondence, 1991.
Shyam Sunder Gupta, Fascinating Factorials, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 16, 411-442.
R. K. Guy and N. J. A. Sloane, Correspondence, 1985.
N. Kuosa, Source for 6380.
Des MacHale and Joseph Manning, Maximal runs of strictly composite integers, The Mathematical Gazette, 99, pp 213-219 (2015).
Romeo Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - From N. J. A. Sloane, Jun 13 2012
Hisanori Mishima, Factors of N!+1.
Rudolf Ondrejka, The Top Ten: a Catalogue of Primal Configurations.
Titus Piezas III, 2004. Solving Solvable Sextics Using Polynomial Decomposition.
PrimePages, Factorial Primes.
Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
Apoloniusz Tyszka, A conjecture which implies that there are infinitely many primes of the form n!+1, Preprint, 2017.
Apoloniusz Tyszka, A common approach to the problem of the infinitude of twin primes, primes of the form n! + 1, and primes of the form n! - 1, 2018.
Apoloniusz Tyszka, On sets X subset of N for which we know an algorithm that computes a threshold number t(X) in N such that X is infinite if and only if X contains an element greater than t(X), 2019.
Apoloniusz Tyszka, On sets X, subset of N, whose finiteness implies that we know an algorithm which for every n, element of N, decides the inequality max (X) < n, (2019).
Eric Weisstein's World of Mathematics, Factorial Prime.
Eric Weisstein's World of Mathematics, Integer Sequence Primes.
Index entries for sequences related to factorial numbers.

Cf. A002982 (n!-1 is prime), A064295. A088332 gives the primes.
Equals A090660 - 1.
Cf. A093804.

[n: n in [0..800] | IsPrime(Factorial(n)+1)]; // Vincenzo Librandi, Oct 31 2018

v = {0, 1, 2}; Do[If[ !PrimeQ[n + 1] && PrimeQ[n! + 1], v = Append[v, n]; Print[v]], {n, 3, 29651}]
Select[Range[100], PrimeQ[#! + 1] &] (* Alonso del Arte, Jul 24 2014 *)

for(n=0,500,if(ispseudoprime(n!+1),print1(n", "))) \\ Charles R Greathouse IV, Jun 16 2011

from sympy import factorial, isprime
for n in range(0,800):
    if isprime(factorial(n)+1):
        print(n, end=', ') # Stefano Spezia, Jan 10 2019

a(19) sent in by Jud McCranie, May 08 2000
a(20) from Ken Davis (kraden(AT)ozemail.com.au), May 24 2002
a(21) found by PrimeGrid around Jun 11 2011, submitted by Eric W. Weisstein, Jun 13 2011
a(22) from Rene Dohmen, Jun 09 2012
a(23) from Rene Dohmen, Jan 12 2022
a(24)-a(25) from Dmitry Kamenetsky, Jun 19 2024

A002982 Numbers k such that k! - 1 is prime.

Original entry on oeis.org

3, 4, 6, 7, 12, 14, 30, 32, 33, 38, 94, 166, 324, 379, 469, 546, 974, 1963, 3507, 3610, 6917, 21480, 34790, 94550, 103040, 147855, 208003

Offset: 1

N. J. A. Sloane

The corresponding primes n!-1 are often called factorial primes.

			From _Gus Wiseman_, Jul 04 2019: (Start)
The sequence of numbers n! - 1 together with their prime indices begins:
                    1: {}
                    5: {3}
                   23: {9}
                  119: {4,7}
                  719: {128}
                 5039: {675}
                40319: {9,273}
               362879: {5,5,430}
              3628799: {10,11746}
             39916799: {6,7,9,992}
            479001599: {25306287}
           6227020799: {270,256263}
          87178291199: {3610490805}
        1307674367999: {7,11,11,16,114905}
       20922789887999: {436,318519035}
      355687428095999: {8,21,10165484947}
     6402373705727999: {17,20157,25293727}
   121645100408831999: {119,175195,4567455}
  2432902008176639999: {11715,659539127675}
(End)

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 166, p. 53, Ellipses, Paris 2008.
R. K. Guy, Unsolved Problems in Number Theory, Section A2.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 118.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See entry 719 at p. 160.

A. Borning, Some results for k!+-1 and 2.3.5...p+-1, Math. Comp., 26:118 (1972), pp. 567-570.
J. P. Buhler et al., Primes of the form n!+-1 and 2.3.5....p+-1, Math. Comp., 38:158 (1982), pp. 639-643.
Chris K. Caldwell, Factorial Primes.
C. K. Caldwell and Y. Gallot, On the primality of n!+-1 and 2*3*5*...*p+-1, Math. Comp., 71:237 (2002), pp. 441-448.
P. Carmody, Factorial Prime Search Progress Pages.
Antonín Čejchan, Michal Křížek, and Lawrence Somer, On Remarkable Properties of Primes Near Factorials and Primorials, Journal of Integer Sequences, Vol. 25 (2022), Article 22.1.4.
Shyam Sunder Gupta, Fascinating Factorials, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 16, 411-442.
R. K. Guy and N. J. A. Sloane, Correspondence, 1985.
H. Dubner, Factorial and primorial primes, J. Rec. Math., 19 (No. 3, 1987), 197-203. (Annotated scanned copy)
Des MacHale and Joseph Manning, Maximal runs of strictly composite integers, The Mathematical Gazette, 99 (2015), pp 213-219. doi:10.1017/mag.2015.28.
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012.
R. Ondrejka, The Top Ten: a Catalogue of Primal Configurations.
PrimeGrid, World Record Factorial Prime!!!.
PrimeGrid, Announcement of 94550, (2010). - _Felix Fröhlich_, Jul 11 2014
PrimeGrid, Announcement of 103040, (2010). - _Felix Fröhlich_, Jul 11 2014
PrimeGrid, Announcement of 147855, (2013). - _Felix Fröhlich_, Jul 11 2014
Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
Eric Weisstein's World of Mathematics, Factorial.
Eric Weisstein's World of Mathematics, Factorial Prime.
Eric Weisstein's World of Mathematics, Integer Sequence Primes.
Robert G. Wilson v, Letter to N. J. A. Sloane, Jan. 1989.
Index entries for sequences related to factorial numbers.

Cf. A002981 (numbers n such that n!+1 is prime).
Cf. A055490 (primes of form n!-1).
Cf. A088332 (primes of form n!+1).
Cf. A000142, A001221, A001222, A046051, A054991, A112798, A325272.

[n: n in [0..500] | IsPrime(Factorial(n)-1)]; // Vincenzo Librandi, Sep 07 2017

Select[Range[10^3], PrimeQ[ #!-1] &] (* Vladimir Joseph Stephan Orlovsky, May 01 2008 *)

is(n)=ispseudoprime(n!-1) \\ Charles R Greathouse IV, Mar 21 2013

from sympy import factorial, isprime
A002982_list = [n for n in range(1,10**2) if isprime(factorial(n)-1)] # Chai Wah Wu, Apr 04 2021

21480 sent in by Ken Davis (ken.davis(AT)softwareag.com), Oct 29 2001
Updated Feb 26 2007 by Max Alekseyev, based on progress reported in the Carmody web site.
Inserted missing 21480 and 34790 (see Caldwell). Added 94550, discovered Oct 05 2010. Eric W. Weisstein, Oct 06 2010
103040 was discovered by James Winskill, Dec 14 2010. It has 471794 digits. Corrected by Jens Kruse Andersen, Mar 22 2011
a(26) = 147855 from Felix Fröhlich, Sep 02 2013
a(27) = 208003 from Sou Fukui, Jul 27 2016

A002109 Hyperfactorials: Product_{k = 1..n} k^k.

Original entry on oeis.org

1, 1, 4, 108, 27648, 86400000, 4031078400000, 3319766398771200000, 55696437941726556979200000, 21577941222941856209168026828800000, 215779412229418562091680268288000000000000000, 61564384586635053951550731889313964883968000000000000000

Offset: 0

N. J. A. Sloane

A054374 gives the discriminants of the Hermite polynomials in the conventional (physicists') normalization, and A002109 (this sequence) gives the discriminants of the Hermite polynomials in the (in my opinion more natural) probabilists' normalization. See refs Wikipedia and Szego, eq. (6.71.7). - Alan Sokal, Mar 02 2012
a(n) = (-1)^n/det(M_n) where M_n is the n X n matrix m(i,j) = (-1)^i/i^j. - Benoit Cloitre, May 28 2002
a(n) = determinant of the n X n matrix M(n) where m(i,j) = B(n,i,j) and B(n,i,x) denote the Bernstein polynomial: B(n,i,x) = binomial(n,i)*(1-x)^(n-i)*x^i. - Benoit Cloitre, Feb 02 2003
Partial products of A000312. - Reinhard Zumkeller, Jul 07 2012
Number of trailing zeros (A246839) increases every 5 terms since the exponent of the factor 5 increases every 5 terms and the exponent of the factor 2 increases every 2 terms. - Chai Wah Wu, Sep 03 2014
Also the number of minimum distinguishing labelings in the n-triangular honeycomb rook graph. - Eric W. Weisstein, Jul 14 2017
Also shows up in a term in the solution to the generalized version of Raabe's integral. - Jibran Iqbal Shah, Apr 24 2021

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 135-145.
A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 50.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 477.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
G. Szego, Orthogonal Polynomials, American Mathematical Society, 1981 edition, 432 Pages.

N. J. A. Sloane, Table of n, a(n) for n = 0..36
Christian Aebi and Grant Cairns, Generalizations of Wilson's Theorem for Double-, Hyper-, Sub-and Superfactorials, The American Mathematical Monthly 122.5 (2015): 433-443.
Mohammad K. Azarian, On the Hyperfactorial Function, Hypertriangular Function, and the Discriminants of Certain Polynomials, International Journal of Pure and Applied Mathematics 36(2), 2007, pp. 251-257. MR2312537. Zbl 1133.11012.
blackpenredpen, What is a Hyperfactorial? Youtube video (2018).
CreativeMathProblems, A beautiful integral | Raabe's integral, Youtube Video (2021).
Steven R. Finch, Glaisher-Kinkelin Constant (gives asymptotic expressions for A002109, A000178) [Broken link]
Steven R. Finch, Glaisher-Kinkelin Constant (gives asymptotic expressions for A002109, A000178) [From the Wayback machine]
Shyam Sunder Gupta, Fascinating Factorials, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 16, 411-442.
A. M. Ibrahim, Extension of factorial concept to negative numbers, Notes on Number Theory and Discrete Mathematics, Vol. 19, 2013, 2, 30-42.
Jeffrey C. Lagarias and Harsh Mehta, Products of binomial coefficients and unreduced Farey fractions, arXiv:1409.4145 [math.NT], 2014.
Jean-Christophe Pain, Series representations for the logarithm of the Glaisher-Kinkelin constant, arXiv:2304.07629 [math.NT], 2023.
Jean-Christophe Pain, Bounds on the p-adic valuation of the factorial, hyperfactorial and superfactorial, arXiv:2408.00353 [math.NT], 2024. See p. 5.
Vignesh Raman, The Generalized Superfactorial, Hyperfactorial and Primorial functions, arXiv:2012.00882 [math.NT], 2020.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl., 332 (2007), 292-314; see Section 5.
László Tóth, Weighted gcd-sum functions, J. Integer Sequences, 14 (2011), Article 11.7.7.
Eric Weisstein's World of Mathematics, Hyperfactorial.
Eric Weisstein's World of Mathematics, K-Function.
Wikipedia, Hermite polynomials.
Index entries for sequences related to factorial numbers.
Index to divisibility sequences.

Cf. A000178, A000142, A000312, A001358, A002981, A002982, A100015, A005234, A014545, A018239, A006794, A057704, A057705, A054374.
Cf. A074962 [Glaisher-Kinkelin constant, also gives an asymptotic approximation for the hyperfactorials].
Cf. A001923, A051675, A240993, A255321, A255323, A255344.
Cf. A246839 (trailing 0's).
Cf. A347345, A347352.
Cf. A261175 (number of digits).

a002109 n = a002109_list !! n
a002109_list = scanl1 (*) a000312_list  -- Reinhard Zumkeller, Jul 07 2012

f := proc(n) local k; mul(k^k,k=1..n); end;
A002109 := n -> exp(Zeta(1,-1,n+1)-Zeta(1,-1));
seq(simplify(A002109(n)),n=0..11); # Peter Luschny, Jun 23 2012

Table[Hyperfactorial[n], {n, 0, 11}] (* Zerinvary Lajos, Jul 10 2009 *)
Hyperfactorial[Range[0, 11]] (* Eric W. Weisstein, Jul 14 2017 *)
Join[{1},FoldList[Times,#^#&/@Range[15]]] (* Harvey P. Dale, Nov 02 2023 *)

a(n)=prod(k=2,n,k^k) \\ Charles R Greathouse IV, Jan 12 2012

a(n)=polcoeff(1-sum(k=0, n-1, a(k)*x^k/prod(j=1,k+1,(1+j^j*x+x*O(x^n)) )), n) \\ Paul D. Hanna, Oct 02 2013

A002109 = [1]
for n in range(1, 10):
    A002109.append(A002109[-1]*n**n) # Chai Wah Wu, Sep 03 2014

a = lambda n: prod(falling_factorial(n,k) for k in (1..n))
[a(n) for n in (0..10)]  # Peter Luschny, Nov 29 2015

a(n)*A000178(n-1) = (n!)^n = A036740(n) for n >= 1.
Determinant of n X n matrix m(i, j) = binomial(i*j, i). - Benoit Cloitre, Aug 27 2003
a(n) = exp(zeta'(-1, n + 1) - zeta'(-1)) where zeta(s, z) is the Hurwitz zeta function. - Peter Luschny, Jun 23 2012
G.f.: 1 = Sum_{n>=0} a(n)*x^n / Product_{k=1..n+1} (1 + k^k*x). - Paul D. Hanna, Oct 02 2013
a(n) = A240993(n) / A000142(n+1). - Reinhard Zumkeller, Aug 31 2014
a(n) ~ A * n^(n*(n+1)/2 + 1/12) / exp(n^2/4), where A = 1.2824271291006226368753425... is the Glaisher-Kinkelin constant (see A074962). - Vaclav Kotesovec, Feb 20 2015
a(n) = Product_{k=1..n} ff(n,k) where ff denotes the falling factorial. - Peter Luschny, Nov 29 2015
log a(n) = (1/2) n^2 log n - (1/4) n^2 + (1/2) n log n + (1/12) log n + log(A) + o(1), where log(A) = A225746 is the logarithm of Glaisher's constant. - Charles R Greathouse IV, Mar 27 2020
From Amiram Eldar, Apr 30 2023: (Start)
Sum_{n>=1} 1/a(n) = A347345.
Sum_{n>=1} (-1)^(n+1)/a(n) = A347352. (End)
From Andrea Pinos, Apr 04 2024: (Start)
a(n) = e^(Integral_{x=1..n+1} (x - 1/2 - log(sqrt(2*Pi)) + (n+1-x)*Psi(x)) dx), where Psi(x) is the digamma function.
a(n) = e^(Integral_{x=1..n} (x + 1/2 - log(sqrt(2*Pi)) + log(Gamma(x+1))) dx). (End)

A103514 a(n) is the smallest m such that primorial(n)/2 - 2^m is prime.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 25, 2, 1, 6, 6, 19, 1, 13, 3, 3, 11, 29, 2, 1, 6, 3, 4, 2, 6, 4, 15, 6, 4, 20, 4, 1, 7, 16, 4, 7, 22, 3, 12, 13, 9, 35, 2, 3, 3, 52, 35, 3, 32, 15, 13, 10, 53, 56, 9, 16, 36, 5, 8, 5, 22, 3, 14, 2, 64, 37, 8, 22, 42, 11, 22, 22, 12, 11, 26, 1, 54, 187, 20, 9

Offset: 2

Lei Zhou, Feb 15 2005

nonn

			P(2)/2-2^0=2 is prime, so a(2)=0;
P(10)/2-2^3=3234846607 is Prime, so a(10)=3.

R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012-2018.

Cf. A002110, A005234, A014545, A018239, A006794, A057704, A057705, A103153, A067026, A067027, A139439, A139440, A139441, A139442, A139443, A139444, A139445, A139446, A139447, A139448, A139449, A139450, A139451, A139452, A139453, A139454, A139455, A139456, A139457, A103514.

nmax = 2^8192; npd = 1; n = 2; npd = npd*Prime[n]; While[npd < nmax, tn = 1; tt = 2; cp = npd - tt; While[(cp > 1) && (! (PrimeQ[cp])), tn = tn + 1; tt = tt*2; cp = npd - tt]; If[cp < 2, Print["*"], Print[tn]]; n = n + 1; npd = npd*Prime[n]]
(* Second program: *)
k = 1; a = {}; Do[k = k*Prime[n]; m = 1; While[ ! PrimeQ[k - 2^m], m++ ]; Print[m]; AppendTo[a, m], {n, 2, 200}]; a (* Artur Jasinski, Apr 21 2008 *)

a(n)=my(t=prod(i=2,n,prime(i)),m); while(!isprime(t-2^m),m++); m \\ Charles R Greathouse IV, Apr 28 2015

Edited by N. J. A. Sloane, May 16 2008 at the suggestion of R. J. Mathar

A005234 Primes p such that 1 + product of primes up to p is prime.

Original entry on oeis.org

2, 3, 5, 7, 11, 31, 379, 1019, 1021, 2657, 3229, 4547, 4787, 11549, 13649, 18523, 23801, 24029, 42209, 145823, 366439, 392113, 4328927, 5256037, 6369619, 7351117, 9562633

Offset: 1

N. J. A. Sloane

Conjecture: if p# + 1 is a prime number, then the next prime is less than p# + exp(1)*p. - Arkadiusz Wesolowski, Feb 20 2013

Conjecture: if p# + 1 is a prime, then the next prime is less than p# + p^2. - Thomas Ordowski, Apr 07 2013

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 134.
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 211, p. 61, Ellipses, Paris 2008.
H. Dubner, A new primorial prime, J. Rec. Math., 21 (No. 4, 1989), 276.
R. K. Guy, Unsolved Problems in Number Theory, Section A2.
F. Le Lionnais, Les Nombres Remarquables, Paris, Hermann, 1983, p. 109, 1983.
Paulo Ribenboim, The New Book of Prime Number Records, p. 13.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 4-5.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 112.

C. K. Caldwell, Prime Pages: Database Search.
C. K. Caldwell, Primorial Primes.
C. K. Caldwell and Y. Gallot, On the primality of n!+-1 and 2*3*5*...*p+-1, Math. Comp., 71 (2001), 441-448.
H. Dubner, Factorial and primorial primes, J. Rec. Math., 19 (No. 3, 1987), 197-203. (Annotated scanned copy)
H. Dubner, A new primorial prime, J. Rec. Math., 21.4 (1989), 276. (Annotated scanned copy)
H. Dubner and N. J. A. Sloane, Correspondence, 1991.
Des MacHale, Infinitely many proofs that there are infinitely many primes, Math. Gazette, 97 (No. 540, 2013), 495-498.
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv:1202.3670 [math.HO], 2012.
R. Ondrejka, The Top Ten: a Catalogue of Primal Configurations.
Eric Weisstein's World of Mathematics, Euclid Number.
Eric Weisstein's World of Mathematics, Primorial Prime.

Cf. A006862 (Euclid numbers).
Cf. A014545 (Primorial plus 1 prime indices: n such that 1 + (Product of first n primes) is prime).
Cf. A018239 (Primorial plus 1 primes).
Cf. A002110, A006794, A057704.

[p:p in PrimesUpTo(3000)|IsPrime(&*PrimesUpTo(p)+1)]; // Marius A. Burtea, Mar 25 2019

N:= 5000: # to get all terms <= N
Primes:= select(isprime, [$2..N]):
P:= 1: count:= 0:
for n from 1 to nops(Primes) do
   P:= P*Primes[n];
   if isprime(P+1) then
     count:= count+1; A[count]:= Primes[n]
   fi
od:
seq(A[i],i=1..count); # Robert Israel, Nov 03 2015

(* This program is not convenient for large values of p *) p = pp = 1; Reap[While[p < 5000, p = NextPrime[p]; pp = pp*p; If[PrimeQ[1 + pp], Print[p]; Sow[p]]]][[2, 1]] (* Jean-François Alcover, Dec 31 2012 *)
With[{p = Prime[Range[200]]}, p[[Flatten[Position[Rest[FoldList[Times, 1, p]] + 1, ?PrimeQ]]]]] (* _Eric W. Weisstein, Nov 03 2015 *)

is(n)=isprime(n) && ispseudoprime(prod(i=1,primepi(n),prime(i))+1) \\ Charles R Greathouse IV, Feb 20 2013

is(n)=isprime(n) && ispseudoprime(factorback(primes([2,n]))+1) \\ M. F. Hasler, May 31 2018

a(n) = A000040(A014545(n+1)). - M. F. Hasler, May 31 2018

42209 sent in by Chris Nash (chrisnash(AT)cwix.com).
145823 discovered and sent in by Arlin Anderson (starship1(AT)gmail.com) and Don Robinson (donald.robinson(AT)itt.com), Jun 01 2000
366439, 392113 from Eric W. Weisstein, Mar 13 2004 (based on information in A014545)
a(23) from Jeppe Stig Nielsen, Aug 08 2024
a(24) from Jeppe Stig Nielsen, Sep 01 2024
a(25) from Jeppe Stig Nielsen, Sep 24 2024
a(26) from Jeppe Stig Nielsen, Nov 10 2024
a(27) from Jeppe Stig Nielsen, Aug 21 2025

A057704 Primorial - 1 prime indices: integers m such that the m-th primorial minus 1 is prime.

Original entry on oeis.org

2, 3, 5, 6, 13, 24, 66, 68, 167, 287, 310, 352, 564, 590, 620, 849, 1552, 1849, 67132, 85586, 234725, 334023, 435582, 446895

Offset: 1

Labos Elemer, Oct 24 2000

There are two versions of "primorial": this is using the definition in A002110. - Robert Israel, Dec 30 2014

As of 28 February 2012, the largest known primorial prime is A002110(85586) - 1 with 476311 digits, found by the PrimeGrid project (see link). - Dmitry Kamenetsky, Aug 11 2015

			The 6th primorial is A002110(6) = 2*3*5*7*11*13 = 30030, and 30030 - 1 = 30029 is a prime, so 6 is in the sequence.

James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 114.

Chris K. Caldwell, Prime Pages: Database Search
Chris K. Caldwell, The top 20: primorial primes
Sílvia Casacuberta, On the divisibility of binomial coefficients, arXiv:1906.07652 [math.NT], 2019. Mentions this sequence.
Benny Lim, Prime Numbers Generated From Highly Composite Numbers, Parabola (2018) Vol. 54, Issue 3.
Eric Weisstein's World of Mathematics, Integer Sequence Primes
Eric Weisstein's World of Mathematics, Primorial Prime
Wikipedia, Primorial prime

Cf. A006794 (Primorial -1 primes: Primes p such that -1 + product of primes up to p is prime).

Cf. A057705, A014545, A005234, A002110, A057706.

P:= 1:
p:= 1:
count:= 0:
for n from 1 to 1000 do
  p:= nextprime(p);
  P:= P*p;
  if isprime(P-1) then
    count:= count+1;
    A[count]:= n;
  fi
od:
seq(A[i],i=1..count); # Robert Israel, Dec 25 2014

a057704[n_] :=
Flatten@Position[
Rest[FoldList[Times, 1, Prime[Range[n]]]] - 1, Integer?PrimeQ]; a057704[500] (* _Michael De Vlieger, Dec 25 2014 *)

lista(nn) = {s = 1; for(k=1, nn, s *= prime(k); if(ispseudoprime(s - 1), print1(k, ", ")); ); } \\ Altug Alkan, Dec 08 2015

is(n) = ispseudoprime(prod(k=1, n, prime(k)) - 1); \\ Altug Alkan, Dec 08 2015

a(n) = A000720(A006794(n)).

a(n) = primepi(A006794(n)).

Corrected by Holzer Werner, Nov 28 2002
a(19)-a(20) from Eric W. Weisstein, Dec 08 2015 (Mark Rodenkirch confirms based on saved log files that all p < 700,000 have been tested)
a(21) from Jeppe Stig Nielsen, Oct 19 2021
a(22)-a(24) from Jeppe Stig Nielsen, Dec 16 2024

cp's OEIS Frontend

A055511 Erroneous version of A006794.

Views

Author

Keywords

A002110 Primorial numbers (first definition): product of first n primes. Sometimes written prime(n)#.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Scheme

Formula

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Extensions

A002982 Numbers k such that k! - 1 is prime.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Extensions

A002109 Hyperfactorials: Product_{k = 1..n} k^k.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

A103514 a(n) is the smallest m such that primorial(n)/2 - 2^m is prime.

Views

Author

Keywords

Examples

Links