The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2

%I

%S 4,4,3,5,7,11,17,17,37,23,47,37,29,19,47,59,19,37,71,59,31,67,239,101,

%T 739,409,43,367,167,251,73,71,419,1567,107,83,223,191,227,449,97,173,

%U 103,523,79,137,223,1163,661,103,103,541,227,2383,433,71,1069,643,251,163

%N 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.

%H Harry J. Smith, <a href="/A286296/b286296.txt">Table of n, a(n) for n = 1..169</a> [Based on b-file for A066889]

%p with(combinat);

%p F:=fibonacci;

%p P:=n->mul(F(i),i=1..n);

%p [seq(nextprime(P(n)+2)-P(n),n=1..100)];

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

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

%Y Cf. A000045.

%K nonn

%O 1,1

%A _Harvey P. Dale_ and _N. J. A. Sloane_, May 31 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 29 15:16 EDT 2020. Contains 333107 sequences. (Running on oeis4.)