|
Search: id:A116206
|
|
|
| A116206 |
|
Primes of the form n^2 + n + 55661, with n >= 0. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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
|
Sequence in context: A083616 A092008 A061740 this_sequence A022224 A138597 A019290
Adjacent sequences: A116203 A116204 A116205 this_sequence A116207 A116208 A116209
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Douglas Winston (douglas.winston(AT)srupc.com), Apr 14 2007
|
|
|
Search completed in 0.002 seconds
|
