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.

A158350 Primes p such that previousPrime(p) + p -+ 1 are twin primes.

This page as a plain text file.
%I A158350 #17 Mar 28 2015 22:37:56
%S A158350 7,11,17,23,31,71,101,127,233,307,311,409,419,443,617,647,661,719,743,
%T A158350 811,839,863,941,1049,1061,1361,1487,1667,1697,1889,2003,2053,2129,
%U A158350 2131,2243,2267,2551,2647,2711,2753,2767,2833,3049,3109,3163,3229,3299,3331
%N A158350 Primes p such that previousPrime(p) + p -+ 1 are twin primes.
%C A158350 Sum of two consecutive primes = arithmetic mean of twin primes.
%H A158350 Vincenzo Librandi, <a href="/A158350/b158350.txt">Table of n, a(n) for n = 1..1000</a>
%e A158350 5+7=12-+1 primes, 7+11=18-+1 primes, 13+17-+1 primes, ...
%p A158350 t1:=[]; for n from 2 to 1000 do p:=ithprime(n); q:=prevprime(p);
%p A158350 if isprime(p+q-1) and isprime(p+q+1) then t1:=[op(t1),p]; fi; od: t1; # _N. J. A. Sloane_, Dec 24 2012
%t A158350 lst={}; Do[p0=Prime[n]; p1=Prime[n+1]; a=p0+p1; If[PrimeQ[a-1] && PrimeQ[a+1], AppendTo[lst, p1]], {n, 1000}]; lst
%Y A158350 Cf. A099349.
%K A158350 nonn
%O A158350 1,1
%A A158350 _Vladimir Joseph Stephan Orlovsky_, Mar 16 2009