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.

A235920 Primes p with prime(p) - p + 1 and (p^2 - 1)/4 - prime(p) both prime.

This page as a plain text file.
%I A235920 #9 Jan 17 2014 04:25:16
%S A235920 17,31,41,43,61,71,83,103,109,173,181,211,271,349,353,541,661,673,743,
%T A235920 811,911,953,971,1171,1429,1471,1483,1723,1787,2053,2203,2579,2749,
%U A235920 3019,3299,3391,3433,3463,3727,3917,4003,4021,4049,4243,4447,4567,4657,4729,4801,4993
%N A235920 Primes p with prime(p) - p + 1 and (p^2 - 1)/4 - prime(p) both prime.
%C A235920 By the conjecture in A235919, this sequence should have infinitely many terms.
%H A235920 Zhi-Wei Sun, <a href="/A235920/b235920.txt">Table of n, a(n) for n = 1..10000</a>
%e A235920 a(1) = 17 with prime(17) - 17 + 1 =   59 - 16 = 43 and (17^2 - 1)/4 - prime(17) = 72 - 59 = 13 both prime.
%t A235920 PQ[n_]:=n>0&&PrimeQ[n]
%t A235920 p[n_]:=PrimeQ[Prime[n]-n+1]&&PQ[(n^2-1)/4-Prime[n]]
%t A235920 n=0;Do[If[p[Prime[k]],n=n+1;Print[n," ",Prime[k]]],{k,1,1000}]
%Y A235920 Cf. A000040, A234695, A235727, A235806, A235914, A235919.
%K A235920 nonn
%O A235920 1,1
%A A235920 _Zhi-Wei Sun_, Jan 17 2014