161281

Properties

Appears in sequences

• Smallest prime of form (n!)*k + 1.at n=7A035094
• Primes of the form 4*k! + 1.at n=3A062538
• a(n) = floor(n*n!/2 + 1).at n=7A082426
• Prime numbers arising from Schorn's proof that there are infinitely many primes.at n=15A104189
• Primes of the form 1024n + 513.at n=29A105132
• Primes of the form 20*k^2 + 32*k + 13.at n=35A154414
• Primes p such that (p+3839)/3840 is also a prime number.at n=7A162141
• a(n) = 4*n! + 1.at n=8A173322
• Triangle T(n, k) = n! * binomial(n, k)^2 - n! + 1, read by rows.at n=23A174689
• Triangle T(n, k) = n! * binomial(n, k)^2 - n! + 1, read by rows.at n=25A174689
• Triangle T(n, k) = n!*(1/k)^2*(binomial(n-1, k-1)*binomial(n, k-1))^2 - n! + 1, read by rows.at n=16A174696
• Triangle T(n, k) = n!*(1/k)^2*(binomial(n-1, k-1)*binomial(n, k-1))^2 - n! + 1, read by rows.at n=19A174696
• Smallest prime factor of the n-th highly totient number (A097942(n)) plus 1.at n=32A209195
• Primes of the form 2520k + 1 for some k.at n=25A217588
• Triangle T(n,k) giving the smallest term in "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k.at n=31A230428
• a(n) = 20*binomial(n,6) + 2*binomial(n,3) + 1.at n=16A341704
• Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.at n=31A362777
• Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=31A362778
• Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.at n=31A362779
• E.g.f. A(x) satisfies A(x) = exp(x * (1 - x*A(x))) / (1 - x*A(x))^2.at n=5A380764