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 A347075 #23 Aug 17 2021 02:14:43 %S A347075 41,157,401,2381,12721,25261,81401,499361,712981,1455781,2705081, %T A347075 4357481,7226501,7684381,7920401,12061661,12703861,21330941,22745561, %U A347075 31955821,49565921,54583961,59015581,127517041,237560441,384769841,455348741,506897581,570410861,591294481,866432341,905167121 %N A347075 Primes of the form p^3 + p^2 + p + 2 where p is prime. %C A347075 Except for 157, all terms == 1 (mod 20). %H A347075 Robert Israel, <a href="/A347075/b347075.txt">Table of n, a(n) for n = 1..10000</a> %F A347075 a(n) = A164939(n)^3 + A164939(n)^2 + A164939(n) + 2. %e A347075 a(3) = 401 because 401 = 7^3 + 7^2 + 7 + 2 and 7 and 401 are prime. %p A347075 f:= proc(p) local q; %p A347075 if not isprime(p) then return NULL fi; %p A347075 q:= p^3+p^2+p+2; %p A347075 if isprime(q) then return q fi %p A347075 end proc: %p A347075 map(f, [seq(i,i=3..1000,2)]); %Y A347075 Cf. A164939. %K A347075 nonn %O A347075 1,1 %A A347075 _J. M. Bergot_ and _Robert Israel_, Aug 15 2021