32141

Properties

Appears in sequences

• Smallest member of a pair of consecutive twin prime pairs that have three primes between them.at n=37A089635
• a(1) = 2, a(2) = 3, a(n+1) = least prime of the form k*(a(n-1)) - a(n) not included earlier.at n=20A114741
• Numbers n such that partition number p(n) == 14 (mod n).at n=10A121015
• Primes p such that (p-1)*p*(p+1)-p-2 and (p-1)*p*(p+1)+p+2 are primes.at n=34A154942
• Lesser of twin primes p1 such that p1*p2+-6 are prime numbers.at n=15A174955
• Lesser of twin primes p1 such that p1*p2-4 and p1*p2-6 are twin prime numbers.at n=18A174957
• Primes of the form p^2+100, where p is prime.at n=23A182476
• Numbers k such that (11^k - 2^k)/9 is prime.at n=10A210506
• Primes p such that f(f(p)) is prime, where f(x) = x^4 + x^3 + x^2 + x + 1 = A053699(x).at n=34A237445
• a(n) = 2*a(n-2) + a(n-3) + a(n-4) for n>=4, a(n) = binomial(n,3) for n<4.at n=24A240607
• Primes of the form 2*n^2+86*n+41.at n=36A243958
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 521", based on the 5-celled von Neumann neighborhood.at n=16A282828
• Primes p such that the sum of the squares of digits of p equals the sum of digits of p^2.at n=10A290972
• The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.at n=61A309748
• Squared length of diagonal of right trapezoid with three consecutive prime length sides.at n=40A360790
• E.g.f. A(x) satisfies A(x) = exp(x*B(x*A(x))), where B(x) = 1 + x*B(x)^4 is the g.f. of A002293.at n=5A382016
• Prime numbersat n=3448