|
Search: id:A060395
|
|
|
| A060395 |
|
Smallest prime that divides k^2 + k + n for k = 0,1,2,.... |
|
+0
2
|
|
| 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 11, 2, 3, 2, 3, 2, 17, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 41, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 11
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Matthew M. Conroy, Home page (listed instead of email address)
C. Rivera, www.primepuzzles.net, Conjecture 17
|
|
FORMULA
|
a(n)=2 if n is equal to 0, 2 or 4 modulo 6; a(n)=3 if n is equal to 1 or 3 modulo 6.
|
|
EXAMPLE
|
To obtain a(7), 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. A060394 gives values of k.
Sequence in context: A053669 A112047 A112048 this_sequence A016026 A086757 A166985
Adjacent sequences: A060392 A060393 A060394 this_sequence A060396 A060397 A060398
|
|
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
|
