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.

A065511 Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.

Original entry on oeis.org

1, 92, 105, 106, 689, 1138, 1280, 1373, 1432, 1600, 1960, 2416, 2683, 2846, 2968, 3042, 3091, 4694, 4884, 5191, 5284, 5642, 6905, 6949, 7074, 7095, 7213, 7274, 7418
Offset: 0

Views

Author

Lubomir Alexandrov, Nov 26 2001

Keywords

Comments

( p(p(n)), p(p(n)+1) ) is twin prime pair with average 6.p(p(m)) (A060213).

Examples

			n = 402 and m = 105 satisfy system (*) at the primes p(p(n)) = 24917 and p(p(m)) = 4153; n = 33521 and m = 7418 satisfy system (*) at the primes p(p(n)) = 5730617 and p(p(m)) = 955103.
		

Crossrefs