44263

Properties

Appears in sequences

• Number of different sets ("cut sets") of triangles a regular (n+2)-gon can be dissected into; two triangulations of an (n+2)-gon are equal if all numbers of congruent triangles coincide.at n=19A033961
• Fourth term of strong prime sextets: p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=14A054816
• Primes p such that the differences between the 5 consecutive primes starting with p are (4,2,4,6).at n=15A078952
• Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=37A145290
• Primes followed by at least five consecutive primes as closely as possible.at n=25A156114
• Number of (n+2) X 7 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=8A186564
• Primes p such that p - d and p + d are also primes, where d is the largest digit of p.at n=27A245877
• Primes p(n) such that p(n) + p(n+3) = p(n+1) + p(n+2) and p(n) + p(n+4) = p(n+2) + p(n+3).at n=33A266882
• Primes for which the sum of all preceding odd-indexed prime gaps is exactly one greater than the sum of all preceding even-indexed prime gaps.at n=32A282178
• Union of 2, A282178, and A330339.at n=45A330554
• Primes p such that Sum_{k=PreviousPrime(p)..p} d(k) = Sum_{k=p..NextPrime(p)} d(k), where d(k) is the number of divisors function A000005.at n=35A353552
• Prime numbersat n=4606