[seqfan] Add a Fibonacci number to get a prime

[Pontus von Brömssen]

I played around with the idea of the recently rejected sequence A361831
(see version #29) and came up with the following variant. Let a(n) be the
smallest k such that n+Fibonacci(k) is prime. The sequence starts (from
n=0): 3, 1, 0, 0, 1, 0, 1, 0, 4, 3, 1. For example, the first Fibonacci
number F such that 8+F is prime is F=3=Fibonacci(4), so a(8)=4.

An informal probabilistic argument indicates that a(n) exists for all n. An
example where a(n) gets fairly large is a(6313)=25224. (The corresponding
prime 6313+F(25224) has 5272 digits.)

Considering that a closely related sequence was rejected, is this sequence
worth submitting?

Best regards,

Pontus