3628811

Properties

Appears in sequences

• Smallest prime > n!.at n=9A037151
• Smallest prime > n!+1.at n=9A037152
• Upper balancing primes to prime-balanced factorials.at n=2A053713
• Primes of the form k! + k + 1.at n=5A073309
• Primes of the form n! + p where p is the smallest prime > n.at n=7A084748
• Smallest prime >= n!.at n=10A087421
• Primes in the sequence f(n) = n! + n + 1 for n even or n! + n + 2 for n odd.at n=6A092764
• a(n) = (prime(n) - 1)! + prime(n).at n=4A100856
• a(n) = greatest prime factor of (prime(n) - 1)! + prime(n).at n=4A100857
• Primes of the form (p - 1)! + p, p prime.at n=4A100858
• Primes of the form k!+11.at n=4A123909
• a(n) = the minimum prime S possible, if S = product of b(k)'s + product of c(k)'s, where the distinct positive integers <= n are partitioned into the two sets {b(k)} and {c(k)}. a(n) = 0 if no prime S exists for that n.at n=11A127166
• a(n) = n! + n + 1.at n=10A213169
• a(n) = 1*2*3*4*5*6*7*8*9*10 + 11*12*13*14*15*16*17*18*19*20 + 21*22*23*24*25*26*27*28*29*30 + ... + (up to n).at n=10A319212
• Irregular triangle read by rows: row n (n>=1) lists the primes of the form prime(n) + k! for k >= 0.at n=14A352912
• a(n) = largest prime of the form prime(n) + k! (k >= 0).at n=4A352913
• a(n) = (n-1)! * Sum_{d|n} d^(n/d) / (d-1)!.at n=10A354849
• a(n) = (n-1)! * Sum_{d|n} d/(d-1)!.at n=10A370580
• a(n) = n! * Sum_{d|n} 1/((d-1)! * (n/d)^d).at n=10A370604
• Prime numbersat n=258690