Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).

A087580

Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).

Terms

    a(0) =2a(1) =3a(2) =5a(3) =11a(4) =31a(5) =47a(6) =73a(7) =157a(8) =191a(9) =521a(10) =877a(11) =1021a(12) =1487a(13) =6011a(14) =7841a(15) =11789a(16) =14983a(17) =33071a(18) =83243a(19) =123833a(20) =156671a(21) =262937a(22) =778763a(23) =825131a(24) =975181a(25) =5102543a(26) =7066723a(27) =12787321a(28) =13815779a(29) =21304139

External references