a(1)=2, a(2)=3, a(n+1) is the smallest prime obtainable using the Fibonacci recurrence, with a(n-1) and a(n-2) as start terms.
A342180
a(1)=2, a(2)=3, a(n+1) is the smallest prime obtainable using the Fibonacci recurrence, with a(n-1) and a(n-2) as start terms.
Terms
- a(0) =2a(1) =3a(2) =5a(3) =13a(4) =31a(5) =313a(6) =2659a(7) =96979a(8) =97340263a(9) =96133996771a(10) =288596670839
External references
- oeis: A342180