33647

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 4x + 3.at n=17A023311
• Primes for which the five closest primes are smaller.at n=21A075037
• Primes for which the six closest primes are smaller.at n=7A075038
• a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.at n=43A089702
• Engel expansion of the twin primes constant ~ .660161815846869573927812110014555778432623360284733413319448.at n=10A096189
• a(n) = prime(prime(A096480(n))).at n=15A096482
• a(n) = 7 + floor((1 + Sum_{j=1..n-1} a(j))/4).at n=38A120165
• Prime sums of 4 positive 5th powers.at n=20A123033
• Primes p such that q-p = 32, where q is the next prime after p.at n=4A126784
• Primes p such that there exist primes p'<p"<p"'<p""<p such that the concatenation of any two among the {p,...,p""} is prime.at n=4A139005
• Number of n X 5 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=17A166808
• Primes of the form 10 * k^2 + 7.at n=28A195905
• Numbers m such that m, m-1, m-2 and m-3 are 1,2,3,4-almost primes respectively.at n=37A201220
• Numbers k such that prime(k) * 2^k - 1 is prime.at n=19A239741
• "Convex" primes: extremal primes in the sense of Tutaj.at n=27A246033
• Second smallest number of complexity n: second smallest number requiring n 1's to build using + and *.at n=30A265360
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 395", based on the 5-celled von Neumann neighborhood.at n=38A271687
• a(n) = smallest prime q such that Sum_{primes p <= q} 1/sqrt(p) >= n.at n=45A292775
• Convex hull primes, that is, prime numbers corresponding to the convex hull of PrimePi, the prime counting function.at n=32A319126
• Primes p such that p^11 - 1 has 8 divisors.at n=13A342067