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 A176969 #5 Jun 28 2013 06:18:34 %S A176969 2,8,10,12,20,22,28,30,32,38,42,48,58,60,62,68,80,90,100,108,110,112, %T A176969 122,128,138,142,148,150,168,172,180,190,198,200,202,210,228,230,232, %U A176969 238,242,248,258,262,268,280,282,302,310,318,340,342,360,362,368,378 %N A176969 Numbers n such that n^2 + 13^2 is prime. %C A176969 The n^2 + d conjecture is a famous and still unsolved problem. %C A176969 It states that there exist an infinite number of primes whose values are of the form n^2 + d for some integer n. %C A176969 This is case d = 13^2. %D A176969 J. Matousek, J. Nesetril: Diskrete Mathematik: eine Entdeckungsreise, Springer-Lehrbuch, 2. Aufl., Berlin, 2007 %D A176969 M. du Sautoy: Die Musik der Primzahlen: Auf den Spuren des groessten Raetsels der Mathematik, Deutscher Taschenbuch Verlag, 2006 %e A176969 2^2 + 13^2 = 173 = prime(40), 2 is first term. %e A176969 12^2 + 13^2 = 313 = prime(65) = palprime(11), 12 is 4th term. %e A176969 310^2 + 13^2 = 96269 = prime(9274) = palprime(106), 310 the 49th term. %o A176969 (PARI) isok(n) = isprime(n^2 + 13^2) \\ _Michel Marcus_, Jun 28 2013 %Y A176969 Cf. A000040, A000290, A056899, A113536, A176371. %K A176969 nonn %O A176969 1,1 %A A176969 Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Apr 29 2010