|
Search: id:A060397
|
|
|
| A060397 |
|
Smallest prime that divides k^2 + k + 2n + 1 for k = 0,1,2,.... |
|
+0
2
|
|
| 3, 3, 5, 3, 3, 11, 3, 3, 17, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 41, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 11, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Bisection of A060395.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..10000
Matthew M. Conroy, Home page (listed instead of email address)
C. Rivera, www.primepuzzles.net, Conjecture 17
|
|
FORMULA
|
a(n)=3 if n is equal to 0 or 1 mod 3.
|
|
EXAMPLE
|
To obtain a(3), note that x^2+x+7 takes the values 7,9,13,19,... for k=0,1,2,... and the smallest prime dividing these numbers is 3.
|
|
CROSSREFS
|
Cf. A060380, A060392-A060398. A060398 gives values of k.
Sequence in context: A063714 A113965 A162277 this_sequence A014780 A073081 A094928
Adjacent sequences: A060394 A060395 A060396 this_sequence A060398 A060399 A060400
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 04 2001
|
|
EXTENSIONS
|
More terms from Matthew M. Conroy, Apr 18 2001
|
|
|
Search completed in 0.002 seconds
|
