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.

A264527 Largest number m such that (2*n-m, 2*n+m) is a prime pair.

This page as a plain text file.
%I A264527 #4 Nov 17 2015 19:06:02
%S A264527 1,1,5,7,7,9,13,13,17,19,19,21,25,23,29,27,31,35,33,37,39,43,41,47,49,
%T A264527 49,53,55,53,51,45,61,63,67,67,63,73,73,77,75,79,81,85,83,89,87,85,95,
%U A264527 97,97,93,93,103,87,99,109,113,115,113,119,117,115,123,127
%N A264527 Largest number m such that (2*n-m, 2*n+m) is a prime pair.
%C A264527 a(n) = A260689(n,A069360(n)).
%H A264527 Reinhard Zumkeller, <a href="/A264527/b264527.txt">Table of n, a(n) for n = 2..10000</a>
%o A264527 (Haskell)
%o A264527 a264527 = last . a260689_row
%Y A264527 Cf. A069360, A260689, A264526.
%K A264527 nonn
%O A264527 2,3
%A A264527 _Reinhard Zumkeller_, Nov 17 2015