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 A096689 #16 May 22 2017 11:50:33
%S A096689 0,2,4,10,16,20,26,34,40,44,46,50,62,64,74,76,80,82,86,92,94,110,122,
%T A096689 140,160,164,170,176,182,200,202,212,214,220,224,232,236,250,262,296,
%U A096689 302,304,310,320,322,326,332,344,346,352,392,400,404,422,424,446,452
%N A096689 Numbers n such that 2n^2 + 3n + 3 is prime.
%C A096689 All n are {2,4} (mod 6), as in A047235, because otherwise 2*n^2 + 3*n + 3 is a multiple of 2 or 3. - _R. J. Mathar_, Jul 17 2012
%F A096689 a(n) = A096691(n)*2.
%t A096689 f[n_]:=n^2+(n+1)^2+(n+2); lst={};Do[p=f[n];If[PrimeQ[p],AppendTo[lst,n]],{n,0,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jul 04 2009 *)
%t A096689 Select[Range[0,500],PrimeQ[2#^2+3#+3]&] (* _Harvey P. Dale_, Jul 19 2011 *)
%o A096689 (PARI) is(n)=isprime(2*n^2+3*n+3) \\ _Charles R Greathouse IV_, May 22 2017
%Y A096689 Cf. A095697, A096690, A096691.
%K A096689 nonn
%O A096689 1,2
%A A096689 _Ray Chandler_, Jul 12 2004