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 A059670 #16 May 30 2023 08:26:49
%S A059670 1,2,3,13,16,20,28,83,136,300,765,1005,1395,3333,30259
%N A059670 Numbers k such that F(k)*2^k + 1 (A006483) is prime, where F(k) is the k-th Fibonacci number.
%C A059670 a(15) > 17000. - _Michael S. Branicky_, Oct 02 2022
%t A059670 Do[ If[ PrimeQ[ Fibonacci[ n ]*2^n + 1 ], Print[ n ] ], {n, 1, 3000} ]
%o A059670 (Python)
%o A059670 from sympy import fibonacci, isprime
%o A059670 def ok(n): return isprime(fibonacci(n)*2**n + 1)
%o A059670 print([k for k in range(1400) if ok(k)]) # _Michael S. Branicky_, Oct 01 2022
%Y A059670 Cf. A000045, A006483.
%K A059670 nonn,more
%O A059670 1,2
%A A059670 _Robert G. Wilson v_, Feb 05 2001
%E A059670 a(14) from _Michael S. Branicky_, Oct 02 2022
%E A059670 a(15) from _Michael S. Branicky_, May 29 2023