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 A239787 #14 Sep 08 2022 08:46:07
%S A239787 1,2,4,6,10,14,26,34,36,40,44,54,64,66,70,84,86,92,100,102,116,122,
%T A239787 134,146,150,152,156,160,172,174,176,180,190,194,200,216,252,254,262,
%U A239787 274,306,320,322,334,336,350,352,374,384,402,414,440,442,444,460
%N A239787 Numbers n such that 3n^3 - 1 is prime.
%C A239787 All the numbers in this sequence, excluding a(1), are even.
%H A239787 Vincenzo Librandi, <a href="/A239787/b239787.txt">Table of n, a(n) for n = 1..1000</a>
%e A239787 3*2^3 - 1 = 23 is prime. Thus, 2 is a member of this sequence.
%t A239787 Select[Range[1000], PrimeQ[3 #^3 - 1] &] (* _Vincenzo Librandi_, Mar 29 2014 *)
%o A239787 (Python)
%o A239787 import sympy
%o A239787 from sympy import isprime
%o A239787 {print(n) for n in range(10**3) if isprime(3*(n**3)-1)}
%o A239787 (PARI) s=[]; for(n=1, 1000, if(isprime(3*n^3-1), s=concat(s, n))); s \\ _Colin Barker_, Mar 27 2014
%o A239787 (Magma) [n: n in [0..1000] | IsPrime(3*n^3-1)]; // _Vincenzo Librandi_, Mar 29 2014
%Y A239787 Cf. A116954.
%K A239787 nonn,easy
%O A239787 1,2
%A A239787 _Derek Orr_, Mar 26 2014