OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000 (first 100 terms from Colin Barker)
EXAMPLE
6 is in the sequence because 6+15+28 (consecutive hexagonal numbers) = 49 = 13+17+19 (consecutive primes).
MAPLE
N:= 100: # to get a(1)..a(100)
count:= 0:
mmax:= floor((sqrt(24*N-87)-9)/12):
for i from 1 while count < N do
mi:= 2*i;
m:= 6*mi^2+9*mi+7;
r:= ceil((m-8)/3);
p1:= prevprime(r+1);
p2:= nextprime(p1);
p3:= nextprime(p2);
while p1+p2+p3 > m do
p3:= p2; p2:= p1; p1:= prevprime(p1);
od:
if p1+p2+p3 = m then
count:= count+1;
A[count]:= mi*(2*mi-1);
fi
od:
seq(A[i], i=1..count); # Robert Israel, Jan 16 2018
PROG
(PARI) L=List(); forprime(p=2, 2000000, q=nextprime(p+1); r=nextprime(q+1); t=p+q+r; if(issquare(24*t-87, &sq) && (sq-9)%12==0, u=(sq-9)\12; listput(L, u*(2*u-1)))); Vec(L)
CROSSREFS
KEYWORD
nonn
AUTHOR
Colin Barker, Jan 16 2018
STATUS
approved