The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116206 Primes of the form n^2 + n + 55661, with n >= 0. 4
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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, ...) LINKS CROSSREFS Cf. A005846. Sequence in context: A217692 A061740 A184094 * A251778 A203866 A205093 Adjacent sequences:  A116203 A116204 A116205 * A116207 A116208 A116209 KEYWORD nonn,less AUTHOR Douglas Winston (douglas.winston(AT)srupc.com), Apr 14 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 24 17:09 EDT 2020. Contains 337321 sequences. (Running on oeis4.)