64513

Properties

Appears in sequences

• Primes of the form 512*k+1.at n=23A076339
• Prime divisors of (10^9)^(10^9) + 1 = 10^9000000000 + 1.at n=1A076670
• Primes p such that p - 6 is a product of two consecutive primes.at n=21A098061
• Primes equal to the product of two successive sexy primes plus 6.at n=12A104229
• Prime Friedman numbers.at n=44A112419
• Primes p such that q-p = 40, where q is the next prime after p.at n=14A126721
• Primes of the form prime(x)*prime(x+1) + (prime(x+1)-prime(x)).at n=11A140121
• Primes of the form 2^j - 2^k + 1, where j > k >= 0.at n=32A152449
• Primes p = prime(k) of form 13//r, s//13 or t//13//u and sod(p) = sod(k).at n=32A169645
• Honaker primes of the form p = 2*k-1 with sum-of-digits(p) = sum-of-digits(k).at n=37A176111
• a(n) = 63*2^(n+1) + 1.at n=9A196657
• Primes of the form 63*2^n + 1.at n=4A196658
• Primes of the form 7n^2 + 1.at n=23A201602
• Number of 5 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 5 X n array.at n=34A220035
• Primes p such that prime(floor(p/10) + (p mod 10)) = p.at n=3A224827
• Primes p = prime(k) such that the representation of p can be split in two parts whose sum is k.at n=4A224843
• Primes of the form 2^k*(2^{phi(m)} - 1) + 1, where k and m are positive integers, and phi(.) is Euler's totient function.at n=26A234388
• Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=0, b=2.at n=16A234590
• (2,3,5,7)-primes (see comments for precise definition).at n=29A262728
• Number of non-unimodal compositions of n covering an initial interval of positive integers.at n=18A332743