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.
lst={};Do[k=n^3-n^2;If[PrimeQ[k-1]&&PrimeQ[k+1],AppendTo[lst,p]],{n,7!}];lst
2^3 + 2^2 = 12 -+ 1 = 11 and 13 (both prime).
[n: n in [1..5*10^3] |IsPrime(n^3+n^2-1) and IsPrime(n^3+n^2+1)]; // Vincenzo Librandi, Dec 26 2015
select(k -> andmap(isprime,[k^3+k^2-1,k^3+k^2+1]), [$1..10000]); # Robert Israel, Jan 07 2025
lst={};Do[k=n^3+n^2;If[PrimeQ[k-1]&&PrimeQ[k+1],AppendTo[lst,n]],{n,8!}];lst
Select[Range[3000], PrimeQ[#^3 + #^2 - 1] && PrimeQ[#^3 + #^2 + 1] &] (* Vincenzo Librandi, Dec 26 2015 *)
isok(n) = isprime(n^3+n^2+1) && isprime(n^3+n^2-1); \\ Michel Marcus, Dec 27 2015
2^3+2^2 = 12, and 12-+1 are primes, so 12 is a term.
lst={};Do[k=n^3+n^2;If[PrimeQ[k-1]&&PrimeQ[k+1],AppendTo[lst,k]],{n,8!}];lst