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 A090693 #14 Sep 25 2014 21:17:05
%S A090693 2,3,5,7,11,15,17,21,25,27,37,41,55,57,67,75,85,91,95,111,117,121,125,
%T A090693 127,131,135,147,151,157,161,171,177,181,185,205,207,211,225,231,237,
%U A090693 241,251,257,261,265,271,281,285,301,307,315,327,341,351,385,387,397
%N A090693 Positive numbers n such that n^2 - 2n + 2 is a prime.
%D A090693 M. Cerasoli, F. Eugeni and M. Protasi, Elementi di Matematica Discreta, Bologna 1988
%D A090693 Emanuele Munarini and Norma Zagaglia Salvi, Matematica Discreta,UTET, CittaStudiEdizioni, Milano 1997
%H A090693 Peter J. C. Moses, <a href="/A090693/b090693.txt">Table of n, a(n) for n = 1..10000</a>
%F A090693 a(n) = A005574(n)+1.
%t A090693 a={};Do[If[PrimeQ[n^2-2n+2],AppendTo[a,n]],{n,1000}];a (* _Peter J. C. Moses_, Apr 02 2013 *)
%t A090693 Select[Range[400],PrimeQ[#^2-2#+2]&] (* _Harvey P. Dale_, May 10 2013 *)
%o A090693 (Python)
%o A090693 # Python 3.2 or higher required.
%o A090693 from itertools import accumulate
%o A090693 from sympy import isprime
%o A090693 A090693_list = [i for i,n in enumerate(accumulate(range(10**5),lambda x,y:x+2*y-3)) if i > 0 and isprime(n+2)] # _Chai Wah Wu_, Sep 23 2014
%Y A090693 A002496 gives primes, A062325 gives prime index. Cf. A001912.
%Y A090693 A005574(n+1) + 1.
%K A090693 easy,nonn
%O A090693 1,1
%A A090693 _Giovanni Teofilatto_, Dec 19 2003
%E A090693 Corrected and extended by _Ray Chandler_, Dec 28 2003
%E A090693 Definition corrected by _Chai Wah Wu_, Sep 23 2014