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.

A172258 Primes p such that exactly one of the numbers 2p-3 and 2p+3 is prime.

This page as a plain text file.
%I A172258 #12 Mar 27 2021 14:57:44
%S A172258 2,3,11,19,23,29,31,37,41,47,71,73,83,89,101,107,139,173,181,191,197,
%T A172258 199,211,227,229,233,241,251,263,269,277,307,311,317,331,337,347,349,
%U A172258 353,373,379,383,397,409,421,431,433,439,443,457,461,463,467,503,509
%N A172258 Primes p such that exactly one of the numbers 2p-3 and 2p+3 is prime.
%H A172258 Harvey P. Dale, <a href="/A172258/b172258.txt">Table of n, a(n) for n = 1..1000</a>
%e A172258 a(1)=2 because 2*2-3=1 (nonprime) and 2*2+3=7 (prime);
%e A172258 a(2)=29 because 2*29-3=55 (nonprime) and 2*29+3=61 (prime).
%p A172258 a := proc (n): if isprime(n) = true and isprime(2*n-3) = true and isprime(2*n+3) = false then n elif isprime(n) = true and isprime(2*n-3) = false and isprime(2*n+3) = true then n else end if end proc: seq(a(n), n = 1 .. 700); # _Emeric Deutsch_, Feb 15 2010
%t A172258 Select[Prime[Range[100]],Total[Boole[PrimeQ[2#+{3,-3}]]]==1&] (* _Harvey P. Dale_, Mar 27 2021 *)
%Y A172258 Cf. A000040, A092110, A131426.
%K A172258 nonn
%O A172258 1,1
%A A172258 _Juri-Stepan Gerasimov_, Jan 30 2010
%E A172258 Definition edited by _Emeric Deutsch_, Feb 15 2010
%E A172258 Corrected and extended by _Emeric Deutsch_, Feb 15 2010