18401

Properties

Appears in sequences

• Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.at n=35A067379
• Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=14A070182
• Expansion of (1-x)/(1-2*x+2*x^2+x^3).at n=22A078004
• The value of C in y = x^2+11x+C such that y is prime for all x = 0 to 6.at n=6A097458
• Primes of the form f(n) = 9*n^4 - 444*n^3 + 8059*n^2 - 63714*n + 185371 listed by increasing value of n >= 0.at n=5A117225
• Primes congruent to 10 mod 53.at n=38A142540
• Primes congruent to 40 mod 61.at n=36A142838
• Primes p such that the multiplicative order of 2 modulo p is (p-1)/10.at n=29A152310
• a(n) = 46*n^2 + 1.at n=20A158632
• E.g.f. satisfies: A(x) = exp(x*exp(2*x*exp(3*x*A(x)))).at n=5A162167
• Prime-generating polynomial: a(n) = 16*n^2 - 292*n + 1373.at n=43A181969
• Position where 10^n-1 occurs in the Kaprekar sequence A006886.at n=38A193992
• Number of free polyplets with n cells that are not polyominoes.at n=7A194596
• Expansion of x^2*(1-x^2)*(1-3*x^2)/(1-x-5*x^2+4*x^3+5*x^4-3*x^5).at n=17A203837
• Primes in A065387 in the order of their appearance.at n=28A229264
• a(1) = 5; a(n) for n > 1 is the smallest prime > a(n-1) that differs from a(n-1) by a square.at n=45A246760
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood.at n=23A273316
• a(0) = 1; a(n) = (1/n) * Sum_{k=0..floor((n-1)/2)} binomial(n,2*k+1)^3 * (2*k+1) * a(n-2*k-1).at n=5A352469
• Primes having only {0, 1, 4, 8} as digits.at n=31A386030
• Prime numbersat n=2108