This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A336480 #20 Dec 24 2023 16:18:20
%S A336480 1,1,1,1,1,1,1,1,37,23,47,37,29,19,47,59,19,37,71,59,31,1,239,101,739,
%T A336480 409,43,1,167,251,73,71,419,1567,107,83,223,191,227,449,97,173,103,
%U A336480 523,79,137,223,1163,661,103,103,541,227,2383,433,71,1069,643,251
%N A336480 a(n) is the smallest positive k such that Fibonorial(n) + k is a prime.
%e A336480 For n=5, Fibonorial(5) + 1 = 30 + 1 = 31 is a prime.
%t A336480 Table[(NextPrime[Fibonorial[n]]-Fibonorial[n]),{n,1,50}]
%t A336480 NextPrime[#]-#&/@Fibonorial[Range[60]] (* _Harvey P. Dale_, Dec 24 2023 *)
%o A336480 (PARI) f(n) = prod(i=1, n, fibonacci(i)); \\ A003266
%o A336480 a(n) = my(fn=f(n)); nextprime(fn+1) - fn; \\ _Michel Marcus_, Jul 23 2020
%Y A336480 Cf. A003266, A053408 (locations of 1's), A336481.
%K A336480 nonn
%O A336480 1,9
%A A336480 _Mohamed Sami Gattoufi_, Jul 22 2020