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 A116206 #7 Dec 13 2019 13:07:42 %S A116206 55661,55663,55667,55673,55681,55691,55717,55733,55793,55817,55843, %T A116206 55871,55901,55933,55967,56003,56041,56081,56123,56167,56311,56417, %U A116206 56473,56531,56591,56783,56921,56993,57143,57221,57301,57383,57467 %N A116206 Primes of the form n^2 + n + 55661, with n >= 0. %C A116206 n^2+n+55661 is the first or second most efficient formula for finding primes until we get to n^2+n+154001 (competitors are n^2+n+41, n^2+n+55661, n^2+n+41537, n^2+n+27941, n^2+n+21377, ...) %Y A116206 Cf. A005846. %K A116206 nonn,less %O A116206 1,1 %A A116206 Douglas Winston (douglas.winston(AT)srupc.com), Apr 14 2007