1088641

Properties

Appears in sequences

• Smallest prime of form (n!)*k + 1.at n=8A035094
• Minimal factorial safe-primes: a prime p = a(n) here if (p-1)/n! = A051888(n).at n=9A051901
• Primes of the form 3*k! + 1.at n=5A062551
• Prime numbers arising from Schorn's proof that there are infinitely many primes.at n=18A104189
• Triangle, read by rows, T(n, k) = T(n, k-1) + (k+1)*n!, T(n, 0) = 1.at n=42A105064
• Primes in the triangle defined by T(0,c)=1, T(1,c)=c, T(r,1)=1 and T(r,c) = T(r,c-1) + c*(r-1)!.at n=14A105071
• Primes obtained from other primes by taking the factorial of each digit and adding them up.at n=30A164767
• a(n) = 3*n! + 1.at n=9A173324
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=38A174690
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=42A174690
• Triangle T(n, k) = n!*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - n! + 1, read by rows.at n=29A174694
• Triangle T(n, k) = n!*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - n! + 1, read by rows.at n=34A174694
• Circuit rank of the n-Bruhat graph.at n=8A317483
• Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.at n=38A362777
• Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=38A362778
• Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=38A362779
• Triangle read by rows: T(n, k) = Sum_{i=0..k-2} (-1)^(i+2) * (k-i-1)^n * binomial(k,i).at n=34A366159
• Prime numbersat n=84894