53611

Properties

Appears in sequences

• Initial prime in set of 4 consecutive primes with common difference 6.at n=19A033451
• First term of balanced prime quartets: p(m+1)-p(m) = p(m+2)-p(m+1) = p(m+3)-p(m+2).at n=19A054800
• Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits.at n=14A060274
• Number of free (rotations and reflections count as same shape) polyominoids (shapes made of faces of cubes) with n squares.at n=6A075679
• Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,4).at n=4A078969
• Primes p such that p, p+6, p+12, p+18 are consecutive primes and p = 6*k+1 for some k.at n=9A090837
• Number of (n+2)X3 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock.at n=8A186560
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock.at n=36A186568
• Primes p with A047967(p) also prime.at n=21A236418
• Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions.at n=13A260016
• Triangle read by rows: T(n,d) is the number of free (d,2)-polyominoids of size n, 2 <= d <= n+1.at n=22A387003
• Prime numbersat n=5463