OFFSET
1,1
FORMULA
MATHEMATICA
Module[{nn=10^7, fibs, twns}, twns=Select[Partition[Prime[Range[nn]], 2, 1], #[[2]]-#[[1]]==2&][[;; , 2]]; fibs=Fibonacci[Range[Floor[Log[GoldenRatio, Sqrt[5]Max[Length[twns]]]]]]; Table[Take[twns, {f, f}], {f, fibs}]]//Flatten (* Harvey P. Dale, Apr 05 2023 *)
PROG
(PARI) g(n) = for(x=1, n, print1(twinu(fibonacci(x))", ")) twinu(n) = { local(c, x); c=0; x=1; while(c<n, if(isprime(prime(x)+2), c++); x++; ); return(prime(x)) }
(PARI) default(primelimit, 20000000); twinu(n) = { local(c, x); c=0; x=1; while(c<n, if(isprime(prime(x)+2), c++); x++); return(prime(x)) } { for(n=1, 25, write("b093307.txt", n, " ", twinu(fibonacci(n)))); } \\ Harry J. Smith, Jun 20 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, Apr 25 2004
EXTENSIONS
a(24)-a(25) from Harry J. Smith, Jun 20 2009
a(26)-a(34) from Giovanni Resta, Jun 10 2018
STATUS
approved