241921

Properties

Appears in sequences

• Primes of the form 6*k! + 1.at n=4A062591
• Smallest prime which is 1 more than the product of n distinct composite numbers.at n=6A081545
• Prime numbers arising from Schorn's proof that there are infinitely many primes.at n=16A104189
• a(n) = 6*n! + 1.at n=8A173314
• Triangle T(n, k) = n! * binomial(n, k)^2 - n! + 1, read by rows.at n=29A174689
• Triangle T(n, k) = n! * binomial(n, k)^2 - n! + 1, read by rows.at n=34A174689
• Smallest prime factor of the n-th highly totient number (A097942(n)) plus 1.at n=35A209195
• Odd integers k>=5 such that 2^((k-1)/2)-1 == 0 (mod k*(k-3)/2).at n=19A337848
• Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.at n=33A362777
• Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=33A362778
• Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=33A362779
• Primes of the form k!*m! + 1, with k <= m.at n=10A392757
• Prime numbersat n=21384