259033

Properties

Appears in sequences

• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.at n=10A054682
• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=10A070018
• Primes for which the seven closest primes are smaller.at n=26A075043
• Smallest prime(k) such that prime(k)-prime(k-n) is equal to prime(k+1)-prime(k).at n=7A089344
• a(n) = prevprime(A090117(n)), the largest prime previous to squares given in A090117, being such that distance of a(n) to the following prime equals 2*n.at n=32A090118
• If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=47A104205
• If mod[n,4]=0 then a(n)=a(n-1), if mod[n,4]=1 then a(n)=a(n-2)+a(n-3), if mod[n,4]=2 then a(n)=a(n-3)+a(n-4)+a(n-5), if mod[n,4]=2 then a(n)=a(n-4)+a(n-5)+a(n-6)+a[n-7].at n=48A104205
• prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 14.at n=17A109568
• Primes that are the sum of 201 consecutive primes.at n=17A215995
• Primes p=prime(i) of level (1,8), i.e., such that A118534(i) = prime(i-8).at n=0A216204
• Primes p such that q - p = 66, where q is the next prime after p.at n=2A225811
• Prime numbersat n=22765