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.

A347988 Primes p such that q divides p^2 + p + 1, r divides q^2 + q + 1 and p divides r^2 + r + 1 for some primes q and r.

This page as a plain text file.
%I A347988 #8 Nov 01 2021 00:55:58
%S A347988 3,13,31,43,61,307,331,631,5233
%N A347988 Primes p such that q divides p^2 + p + 1, r divides q^2 + q + 1 and p divides r^2 + r + 1 for some primes q and r.
%C A347988 There are no other terms below 2^24. Clearly, if a prime p is in this sequence, then so are q and r. Taking such prime triples (p, q, r) with p smallest, we have three triples (3, 13, 61), (31, 331, 5233), and (43, 631, 307) below 2^24.
%e A347988 3 is a term since 3^2 + 3 + 1 = 13, 13^2 + 13 + 1 = 3 * 61, and 61^2 + 61 + 1 = 3 * 13 * 97.
%o A347988 (PARI) is(p)={my(W,V1,V2,V3,q1,q2,q3,i1,i2,i3,l1,l2,l3);W=0;V1=factor(p^2+p+1);l1=length(V1[,1]);for(i1=1,l1,q1=V1[i1,1];V2=factor(q1^2+q1+1);l2=length(V2[,1]);for(i2=1,l2,q2=V2[i2,1];V3=factor(q2^2+q2+1);l3=length(V3[,1]);for(i3=1,l3,q3=V3[i3,1];if(q3==p,W=[p,q1,q2]))));W}
%Y A347988 Cf. A101368.
%K A347988 nonn,hard,more
%O A347988 1,1
%A A347988 _Tomohiro Yamada_, Sep 23 2021