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.

A339775 Primes p such that (p+nextprime(p))/6 is prime and 6*p is the sum of two consecutive primes.

This page as a plain text file.
%I A339775 #7 Dec 16 2020 19:25:38
%S A339775 5,7,13,37,127,389,719,937,3089,7669,9199,12211,17099,17519,18919,
%T A339775 19259,19273,19853,20063,21379,22453,22643,23059,23143,23173,23753,
%U A339775 24113,24329,25339,25873,31387,31667,32803,33203,34057,34183,36629,37253,37831,37967,38557,39293,40429,41039,42743,48163
%N A339775 Primes p such that (p+nextprime(p))/6 is prime and 6*p is the sum of two consecutive primes.
%H A339775 Robert Israel, <a href="/A339775/b339775.txt">Table of n, a(n) for n = 1..10000</a>
%e A339775 a(3) = 13 is a term because 13 is prime, the next prime is 17, (13+17)/6 = 5 is prime, and 6*13 = 78 = 37 + 41 is the sum of consecutive primes.
%p A339775 filter:= proc(p) local q;
%p A339775   if not isprime(p) then return false fi;
%p A339775   q:= prevprime(3*p);
%p A339775   if q + nextprime(q) <> 6*p then return false fi;
%p A339775   q:= (p+nextprime(p))/6;
%p A339775   q::integer and isprime(q)
%p A339775 end proc:
%p A339775 select(filter, [seq(i,i=3..10^5,2)]);
%Y A339775 Intersection of A163487 and A288632.
%K A339775 nonn
%O A339775 1,1
%A A339775 _J. M. Bergot_ and _Robert Israel_, Dec 16 2020