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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116206 Primes of the form n^2 + n + 55661, with n >= 0. 4

%I

%S 55661,55663,55667,55673,55681,55691,55717,55733,55793,55817,55843,

%T 55871,55901,55933,55967,56003,56041,56081,56123,56167,56311,56417,

%U 56473,56531,56591,56783,56921,56993,57143,57221,57301,57383,57467

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

%C 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 Cf. A005846.

%K nonn,less

%O 1,1

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

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 12 16:24 EDT 2021. Contains 342927 sequences. (Running on oeis4.)