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.

A022889 n-th prime p(k) such that p(k) + p(k+5) = p(k+1) + p(k+4).

This page as a plain text file.
%I A022889 #7 Aug 06 2015 05:11:45
%S A022889 5,7,19,31,41,97,103,131,151,179,193,197,233,251,277,281,293,331,503,
%T A022889 563,587,599,641,653,683,719,727,809,811,823,827,839,853,857,859,877,
%U A022889 907,937,941,947,1013,1061,1097,1163,1187,1279,1433,1451
%N A022889 n-th prime p(k) such that p(k) + p(k+5) = p(k+1) + p(k+4).
%H A022889 R. J. Mathar, <a href="/A022889/b022889.txt">Table of n, a(n) for n = 1..501</a>
%t A022889 Transpose[Select[Partition[Prime[Range[500]],6,1],#[[6]]+#[[1]] == #[[5]]+#[[2]]&]][[1]] (* _Harvey P. Dale_, Jul 13 2012 *)
%K A022889 nonn
%O A022889 1,1
%A A022889 _Clark Kimberling_