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.

A065505 Let p(k) denote k-th prime; consider solutions (p(n),p(m)) of Diophantine equation p(p(n)+1)-6.p(p(m))=1 (*), where p(p(n)) belongs to A060213 and p(p(m))=(p(p(n))+1)/6; sequence gives values of p(n).

Original entry on oeis.org

7, 2309, 2753, 2789, 26183, 46933, 53597, 58411, 61357, 69481, 87691, 111487, 124991, 134327, 140659, 144651, 147551, 236519, 247711, 164643, 270223, 291359
Offset: 0

Views

Author

Lubomir Alexandrov, Nov 25 2001

Keywords

Examples

			p(n)=395581 and p(m)=75277 satisfy equation (*) at the primes p(p(n))=5730617 and p(p(m))=955103.
		

Crossrefs