33211

Properties

Appears in sequences

• Third term of weak prime sextet: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=11A054830
• n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...at n=35A055611
• Numbers k such that 4^k - 3 is prime.at n=32A059266
• Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.at n=26A061493
• The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).at n=35A071157
• a(1) = 11, a(n) = smallest prime obtained by starting with a(n-1) and prefixing it with one or more copies of (the decimal expansion of) n.at n=2A088061
• Primes of the form 5k^2 + 5k + 1.at n=42A090562
• Digit reversal of A096299(n).at n=21A096104
• Primes occurring in A084704 exactly 4 times.at n=16A128655
• Smallest of three consecutive primes whose sum is a triangular number.at n=12A226148
• Primes p such that p^4-p^3+1 and p^4-p^3-1 are also primes.at n=12A238136
• a(n) = floor(5*prime(n)^2 / 4).at n=37A246010
• Primes p such that the sum of the cubes of digits of p equals the sum of digits of p^3.at n=17A291052
• Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,3) - p = 2*n, or -1 if no such prime exists.at n=37A339943
• T(n,k) = coefficient of x^n*y^k in A(x,y) such that: x = Sum_{n=-oo..+oo} (-1)^n * x^n * (y + x^n)^n * A(x,y)^n.at n=49A359720
• Prime numbers with monotonically decreasing digits, differing by at most 1.at n=18A378775
• a(n) is the smallest prime k such that (prime(n), k, u, v) are the vertices of a square in Ulam's spiral, where k < u < v are all primes; or -1 if there is no such k.at n=24A383595
• Primes with at least two identical trailing digits and at least two identical leading digits.at n=22A384015
• Prime numbersat n=3560