cp's OEIS Frontend

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.

A116206 Primes of the form n^2 + n + 55661, with n >= 0.

Original entry on oeis.org

55661, 55663, 55667, 55673, 55681, 55691, 55717, 55733, 55793, 55817, 55843, 55871, 55901, 55933, 55967, 56003, 56041, 56081, 56123, 56167, 56311, 56417, 56473, 56531, 56591, 56783, 56921, 56993, 57143, 57221, 57301, 57383, 57467
Offset: 1

Views

Author

Douglas Winston (douglas.winston(AT)srupc.com), Apr 14 2007

Keywords

Comments

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, ...)

Crossrefs

Cf. A005846.