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 A246666 #28 Sep 11 2014 12:51:56 %S A246666 1,3,5,9,31,43,45,51,71,89,135,141,145,149,159,163,169,183,185,225, %T A246666 233,241,255,261,271,281,283,285,299,309,311,313,355,395,401,411,415, %U A246666 423,429,435,449,453,485,491,541,551,561,579,583,589,603,621,625,635,681 %N A246666 Numbers n such that n^3 + (n+1)^3 + (n+3)^3 is prime. %C A246666 All terms are odd. - _Jon Perry_, Sep 11 2014 %H A246666 Nathaniel Johnston, <a href="/A246666/b246666.txt">Table of n, a(n) for n = 1..10000</a> %e A246666 a(5)=31 since 31^3+(31+1)^3+(31+3)^3=101863 is prime. %p A246666 isA246666 := proc (n) return isprime(n^3+(n+1)^3+(n+3)^3) end proc; seq(`if`(isA246666(2*n-1), 2*n-1, NULL), n = 1 .. 400); # _Nathaniel Johnston_, Sep 09 2014 %o A246666 (PARI) for(n=0,10^3,if(isprime(n^3+(n+1)^3+(n+3)^3),print1(n,", "))); \\ _Joerg Arndt_, Sep 09 2014 %o A246666 (Python) %o A246666 from sympy import isprime %o A246666 A246666_list = [n for n in range(1,10**5) if isprime(3*n*(n*(n+4)+10)+28)] %o A246666 # _Chai Wah Wu_, Sep 09 2014 %K A246666 nonn %O A246666 1,2 %A A246666 _Carmine Suriano_, Sep 01 2014