|
|
A124067
|
|
Numbers k such that 2*F(k) + 1 is a prime, where F = A000045.
|
|
3
|
|
|
1, 2, 3, 4, 5, 6, 8, 11, 13, 19, 21, 22, 24, 27, 40, 44, 51, 62, 92, 139, 208, 224, 293, 307, 421, 509, 741, 861, 966, 989, 1046, 1100, 1102, 1109, 1182, 1547, 1766, 1813, 2048, 2720, 2726, 6012, 6790, 7132, 8301, 8699, 10062, 11102, 15827, 23918, 26747, 29389, 37229, 38211, 68726
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[10000], PrimeQ[2 Fibonacci[#] + 1]&] (* Vincenzo Librandi, Aug 13 2013 *)
|
|
PROG
|
(PARI) isok(n) = isprime(2*fibonacci(n)+1) \\ Michel Marcus, Jun 03 2013
(Magma) [n: n in [1..1200] | IsPrime(2*Fibonacci(n)+1)]; // Vincenzo Librandi, Aug 13 2013
(PARI) for(n=1, 10^9, if(ispseudoprime(2*fibonacci(n)+1), print1(n, ", "))); \\ Joerg Arndt, Aug 13 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|