69499

Properties

Appears in sequences

• The lexicographically earliest sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.at n=16A059874
• a(n) is a prime power and sum of all prime powers <= a(n) is A025475.at n=3A068343
• Primes for which the six closest primes are smaller.at n=14A075038
• Primes for which the seven closest primes are smaller.at n=5A075043
• Last term of prime quadruples.at n=29A090258
• Primes with digit sum = 37.at n=18A106771
• Primes having only {4, 6, 9} as digits.at n=22A107666
• Primes p such that q-p = 40, where q is the next prime after p.at n=15A126721
• Twin primes p and r (p < r) such that p-1, p+1 and r+1 are not cubefree.at n=1A162874
• Primes 6k + 1 preceding the maximal gaps in A268925.at n=11A268926
• Primes p such that A001175(p) = (p-1)/9.at n=34A308794
• Primes p such that A001177(p) = (p-1)/9.at n=20A308802
• Primes of the form 6k + 1 preceding the first-occurrence gaps in A330853.at n=18A330854
• 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=46A339943
• Prime numbersat n=6902