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.

A236569 Least term p of A236568 with 2*n - p prime, or 0 if such a prime p does not exist.

This page as a plain text file.
%I A236569 #6 Jan 29 2014 10:33:19
%S A236569 0,0,3,3,3,5,3,3,5,3,3,5,3,5,11,3,3,5,31,3,5,3,3,5,3,5,11,3,5,31,3,3,
%T A236569 5,31,3,5,3,3,5,43,3,5,3,5,11,3,5,43,31,3,5,3,3,5,3,3,5,3,5,11,43,11,
%U A236569 43,31,3,5,3,5,11,3
%N A236569 Least term p of A236568 with 2*n - p prime, or 0 if such a prime p does not exist.
%C A236569 The conjecture in A236566 implies that a(n) > 0 for all n > 2.
%H A236569 Zhi-Wei Sun, <a href="/A236569/b236569.txt">Table of n, a(n) for n = 1..10000</a>
%e A236569 a(3) = 3 since prime(3 + 2) + 2 = 11 + 2 = 13 and 2*3 - 3 = 3 are both prime, but prime(2 + 2) + 2 = 9 is not.
%t A236569 p[m_]:=PrimeQ[Prime[m+2]+2]
%t A236569 Do[Do[If[p[Prime[k]]&&PrimeQ[2n-Prime[k]],Print[n," ",Prime[k]];Goto[aa]],{k,1,PrimePi[2n-1]}];
%t A236569 Print[n," ",0];Label[aa];Continue,{n,1,100}]
%Y A236569 Cf. A000040, A020481, A236566, A236568.
%K A236569 nonn
%O A236569 1,3
%A A236569 _Zhi-Wei Sun_, Jan 29 2014