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 A096659 #15 Aug 12 2013 18:45:06 %S A096659 2,3,3,5,23,31,47,59,13,29,17,37,23,47,73,251,281,313,347,383,421 %N A096659 Earliest value of C in y = x^2+(2n-1)x+C such that y is prime for all x = 0 to n. %C A096659 a(0) is the first term of A000040; a(1) is the first term of A001359; a(2) is the first term of A046136; a(3) is the first term of A097434; a(4) is the first term of A097436; a(5) is the first term of A097437; a(6) is the first term of A097458; a(7) is the first term of A097459; a(8) is the first term of A097460; a(9) is the first term of A097461. %C A096659 Sequence is infinite under Dickson's conjecture. - _Charles R Greathouse IV_, Aug 11 2013 %C A096659 a(20) > 10^10; probably a(20) > 10^20. - _Charles R Greathouse IV_, Aug 12 2013 %e A096659 Triangle of y, primes, starts: %e A096659 2, %e A096659 3, 7, %e A096659 3, 9, 17, %e A096659 5, 13, 23, 35, %e A096659 23, 33, 45, 59, 75, %e A096659 31, 43, 57, 73, 91, 111, %e A096659 47, 61, 77, 95, 115, 137, 161, %e A096659 59, 75, 93, 113, 135, 159, 185, 213, %e A096659 ... %o A096659 (PARI) a(n) = C = 1; ok = 0; while (! ok, ok = 1; for (x = 0, n, if (! isprime(x^2+(2*n-1)*x+C), ok = 0; break;);); if (ok, return (C)); C++;); \\ _Michel Marcus_, Aug 10 2013 %o A096659 (PARI) works(C,n)=for(x=1,n,if(!isprime(x^2+(2*n-1)*x+C), return(0)));1 %o A096659 a(n)=forprime(C=2,,if(works(C,n),return(C))) \\ _Charles R Greathouse IV_, Aug 12 2013 %K A096659 nonn,more %O A096659 0,1 %A A096659 _Ray G. Opao_, Aug 25 2004