cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A278735 Smallest prime-indexed prime ending an arithmetic progression of n prime-indexed primes.

Original entry on oeis.org

3, 5, 17, 587, 47857, 7336423, 785979097
Offset: 1

Views

Author

Bobby Jacobs, Nov 27 2016

Keywords

Comments

The first set of 4 prime-indexed primes in arithmetic progression (353, 431, 509, and 587) contains consecutive terms of A142160.

Examples

			a(4) = 587 because 353 = prime(prime(20)), 431 = prime(prime(23)), 509 = prime(prime(25)), 587 = prime(prime(28)), and 431-353 = 509-431 = 587-509 = 78.
From _Charles R Greathouse IV_, Nov 27 2016: (Start)
The corresponding arithmetic progressions are
3;
3, 5;
5, 11, 17;
353, 431, 509, 587;
13297, 21937, 30577, 39217, 47857;
1561423, 2716423, 3871423, 5026423, 6181423, 7336423;
and with the main diagonal being terms of this sequence. (End)
		

Crossrefs

Right border of A279021.

Programs

  • PARI
    findAP(len)=my(t); if(len<3, return(v[len])); for(i=len, #v, for(j=1, i-len+1, t=(v[i]-v[j])/(len-1); if(denominator(t)>1, next); forstep(k=v[j]+t, v[i]-t, t, if(!setsearch(v, k), next(2))); return(vector(len, k, v[j]+(k-1)*t)))); "not found"
    listPIP(lim)=my(v=List(), p); forprime(q=2, lim, if(isprime(p++), listput(v, q))); Vec(v)
    v=listPIP(1e7);
    apply(findAP, [1..6]) \\ Charles R Greathouse IV, Nov 27 2016

Extensions

a(7) from Charles R Greathouse IV, Dec 27 2016