110251

Properties

Appears in sequences

• Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p.at n=32A059667
• Prime numbers p of the form 10k+1 for which the pentanacci quintic polynomial x^5-x^4-x^3-x^2-x-1 modulus p is factorizable into five binomials.at n=20A135843
• a(n) = Sum_{i=0..n} Sum_{j=0..n} Sum_{k=0..n} (i+j+k)!/(i!*j!*k!).at n=4A144660
• Primes of the form 10n^2 + 1.at n=30A201709
• Number of n X 2 (-1,0,1) arrays of determinants of 2 X 2 subblocks of some (n+1) X 3 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=20A226866
• Primes p of the form m^2 + 27.at n=40A227622
• Numbers k such that k!*2^k + 1 is prime.at n=7A256594
• Centered 14-gonal (or tetradecagonal) primes.at n=28A264821
• a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of 10 primes.at n=17A285694
• A(n,k) = Sum_{i_1=0..n} Sum_{i_2=0..n} ... Sum_{i_k=0..n} multinomial(i_1 + i_2 + ... + i_k; i_1, i_2, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=32A308292
• a(n) = Sum_{i_1=0..4} Sum_{i_2=0..4} ... Sum_{i_n=0..4} multinomial(i_1 + i_2 + ... + i_n; i_1, i_2, ..., i_n).at n=3A308295
• a(n) = n*(n + 5)*(n + 7)*(n + 10)/24 + 1.at n=35A323220
• Primes p such that there exists a cyclic permutation of the nonzero residues modulo p such that v^2 - 4*u*w == 0 (mod p) for any three consecutive residues u,v,w.at n=13A376008
• Prime numbersat n=10469