A286296 a(n) = nextprime(P(n)+2) - P(n), where P(n) = Product_{k=1..n} Fibonacci(k) and nextprime(i) is the smallest prime > i.

4, 4, 3, 5, 7, 11, 17, 17, 37, 23, 47, 37, 29, 19, 47, 59, 19, 37, 71, 59, 31, 67, 239, 101, 739, 409, 43, 367, 167, 251, 73, 71, 419, 1567, 107, 83, 223, 191, 227, 449, 97, 173, 103, 523, 79, 137, 223, 1163, 661, 103, 103, 541, 227, 2383, 433, 71, 1069, 643, 251, 163

Offset: 1

Author

Harvey P. Dale and N. J. A. Sloane, May 31 2017

Keywords

• nonn

Links

• Harry J. Smith, Table of n, a(n) for n = 1..169 [Based on b-file for A066889]

Crossrefs

A066889 is closely related (it is the same except for the first two terms).

Cf. A000045.

Programs

Maple

with(combinat);
F:=fibonacci;
P:=n->mul(F(i),i=1..n);
[seq(nextprime(P(n)+2)-P(n),n=1..100)];

Mathematica

NextPrime[#+2]-#&/@FoldList[Times,Fibonacci[Range[60]]] (* Harvey P. Dale, Jun 01 2017 *)