68909

Properties

Appears in sequences

• Primes of form n^2 + n + 3.at n=31A027753
• Primes having only {0, 6, 8, 9} as digits.at n=28A053580
• 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=24A054830
• Fourth term of weak prime sextet: 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=23A054831
• Fourth term of weak prime septet: 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) < p(m+3)-p(m+2).at n=3A054837
• Numbers k such that 64^k - 63^k is prime.at n=9A062630
• Every digit of prime and its index contains a loop (only digits 0,4,6,8,9 in prime and its index).at n=11A107625
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=48A121554
• Middle of 3 consecutive prime numbers, p1, p2, p3, such that p1*p2*p3*d1*d2 = average of twin prime pairs; d1 (delta) = p2 - p1, d2 (delta) = p3 - p2.at n=32A153410
• Primes that contain all the digits {0,6,8,9} and only these digits.at n=11A156200
• Lesser of two Pythagorean primes for which the Pythagorean triangles have the same area.at n=32A157184
• Primes p that can be written as phi(k) + d(k) for some k, where phi(k) = A000010(k) is Euler's totient function and d(k) = A000005(k) is the number of divisors of k.at n=39A357916
• Prime numbersat n=6849