OFFSET
1,1
COMMENTS
Middle terms of three consecutive prime-indexed primes that form an arithmetic progression.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..10000
FORMULA
Terms q(k) such that 2*q(k) = q(k-1) + q(k+1) where q(n) = prime(prime(n)) = A006450(n).
EXAMPLE
MATHEMATICA
With[{pip = Prime[Prime[Range[10000]]]}, pip[[1 + Position[Differences[pip, 2], 0] // Flatten]]] (* Amiram Eldar, Dec 01 2025 *)
PROG
(Python)
from sympy import prime
def pip(n):
return prime(prime(n))
def equidistant_pips(max_k=10000):
terms = []
indices = []
q_prev = pip(1)
q_curr = pip(2)
for k in range(2, max_k):
q_next = pip(k + 1)
if q_curr - q_prev == q_next - q_curr:
terms.append(q_curr)
indices.append(k)
q_prev, q_curr = q_curr, q_next
return terms, indices
(PARI) lista(n)={my(L=List(), k=0, q=0, r=0); forprime(p=2, oo, k++; if(isprime(k), if(p-q==q-r, listput(L, q); if(#L==n, break)); r=q; q=p)); Vec(L)} \\ Andrew Howroyd, Nov 29 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Bruce Nye, Nov 29 2025
STATUS
approved
