|
Search: id:A105760
|
|
|
| A105760 |
|
Numbers n such that (2*n + 7) is prime. |
|
+0
9
|
|
| 0, 2, 3, 5, 6, 8, 11, 12, 15, 17, 18, 20, 23, 26, 27, 30, 32, 33, 36, 38, 41, 45, 47, 48, 50, 51, 53, 60, 62, 65, 66, 71, 72, 75, 78, 80, 83, 86, 87, 92, 93, 95, 96, 102, 108, 110, 111, 113, 116, 117, 122, 125, 128, 131, 132, 135, 137, 138, 143, 150, 152, 153, 155, 162
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
|
|
EXAMPLE
|
If n=0, then 2*0 + 7 = 7 (prime).
If n=15, then 2*15 + 7 = 37 (prime).
If n=27, then 2*27 + 7 = 61 (prime).
|
|
CROSSREFS
|
Sequence in context: A035057 A005099 A161720 this_sequence A050834 A095172 A127312
Adjacent sequences: A105757 A105758 A105759 this_sequence A105761 A105762 A105763
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), May 04 2005
|
|
EXTENSIONS
|
More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 18 2005
|
|
|
Search completed in 0.002 seconds
|
