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.

This page as a plain text file.
%I A065511 #2 Mar 31 2012 20:30:48
%S A065511 1,92,105,106,689,1138,1280,1373,1432,1600,1960,2416,2683,2846,2968,
%T A065511 3042,3091,4694,4884,5191,5284,5642,6905,6949,7074,7095,7213,7274,7418
%N 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.
%C A065511 ( p(p(n)), p(p(n)+1) ) is twin prime pair with average 6.p(p(m)) (A060213).
%e A065511 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.
%Y A065511 A060213
%K A065511 nonn
%O A065511 0,2
%A A065511 _Lubomir Alexandrov_, Nov 26 2001