200560490131
domain: N
Appears in sequences
- Largest prime factor of 1 + (product of first n primes).at n=10A002585
- Euclid numbers: 1 + product of the first n primes.at n=11A006862
- Primorial primes: primes of the form 1 + product of first k primes, for some k.at n=6A018239
- a(n) is the smallest prime > product of the first n primes (A002110(n)).at n=11A038710
- Smallest prime factor of 1 + (product of first n primes).at n=10A051342
- Smallest number m such that phi(m) is a multiple of n-th primorial number, the product of first n primes.at n=10A066676
- Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.at n=10A073917
- Smallest prime which is 1 more than a product of n distinct primes: a(n) is a prime and a(n) - 1 is a squarefree number with n prime factors.at n=11A073918
- Erroneous version of A018239.at n=5A091312
- Duplicate of A018239.at n=6A096350
- Singular primes mentioned in A096833 around the listed primorials.at n=2A096834
- Primes of the form A019565(2^n-1-k)+A019565(k) with minimum k.at n=10A103785
- Near primorial primes: primes p such that p+1 or p-1 is a primorial number (A002110).at n=10A228486
- Primes p at which phi(p-1)/(p-1) reaches a new minimum, where phi is Euler's totient function.at n=21A241196
- Euclid numbers (A006862) of the form 3*(i*i + i*j + j*j + i + j) + 1 where i and j are integers.at n=6A261558
- Least prime k>1 such that the sum of divisors of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=29A272981
- Least prime k>1 such that the sum of divisors of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=30A272981
- Numbers n such that phi(n)/phi(phi(n)) > phi(m)/phi(phi(m)) for all m < n.at n=16A289125
- a(n) is the least prime of the form 2*x+1 where x is the product of n consecutive primes.at n=10A347866
- a(n) is the largest prime of the form P+1 where P divides prime(n)# and p# denotes the product of all primes <= p.at n=10A365021