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.
%I A274507 #19 Jul 08 2016 11:14:41 %S A274507 19,31,67,127,151,211,271,307,547,727,787,811,907,967,991,1447,1531, %T A274507 1831,1867,2131,2467,2647,2887,2971,3967,5107,5227,5407,5431,5827, %U A274507 6091,6427,6451,6607,6907,6991,7411,8191,8431,8707,9511,10111 %N A274507 Primes one more than the sum over a pair of prime numbers that differ by 8. %C A274507 Any prime p in this sequence is such that p = (p-9)/2 + (p+7)/2 + 1, where (p-9)/2 and (p+7)/2 are also primes and they differ by 8. %C A274507 This sequence is infinite under Dickson's conjecture. - _Charles R Greathouse IV_, Jul 08 2016 %e A274507 19 = 5 + 13 + 1. Note that, (19-9)/2 = 5 and (19+7)/2 = 13 and the prime pairs 5 and 13 differ by 8. %e A274507 31 = 11 + 19 + 1. Note that, (31-9)/2 = 11 and (31+7)/2 = 19 and the prime pairs 11 and 19 differ by 8. %t A274507 Select[2 # + 9 &@ Select[Prime@ Range[10^3], PrimeQ[# + 8] &], PrimeQ] (* _Michael De Vlieger_, Jun 26 2016 *) %o A274507 (PARI) lista(nn)=forprime(p=3, nn, if (isprime(p+8) && isprime(q=2*p+9), print1(q, ", "))); \\ _Michel Marcus_, Jun 25 2016 %Y A274507 Cf. A023202, A274506. %Y A274507 A subsequence of A068229 and also of A145472. %K A274507 nonn %O A274507 1,1 %A A274507 _Debapriyay Mukhopadhyay_, Jun 25 2016