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 A074824 #27 Oct 23 2024 10:49:50
%S A074824 1,2,4,5,8,11,16,19,44,88,224,349,520,1187,2044,2636,2645,3994,6851,
%T A074824 12016,16304,31388,54296,56608,100700,134387
%N A074824 Numbers k such that 2^k + Fibonacci(k) is prime.
%C A074824 2^(3n) + Fibonacci(3n) is even if n>0.
%t A074824 Do[ If[ PrimeQ[ 2^n + Fibonacci[n]], Print[n]], {n, 1, 5000}]
%o A074824 (PARI) is(n)=ispseudoprime(fibonacci(n)+2^n) \\ _Charles R Greathouse IV_, May 22 2017
%Y A074824 Cf. A000045, A074716, A117591.
%K A074824 nonn,more
%O A074824 1,2
%A A074824 _Robert G. Wilson v_, Sep 06 2002
%E A074824 a(19)-a(21) from _Ryan Propper_, Aug 30 2005
%E A074824 a(22) from _Amiram Eldar_, May 10 2022
%E A074824 a(23)-a(24) from _Michael S. Branicky_, May 15 2023
%E A074824 a(25)-a(26) from _Michael S. Branicky_, Oct 23 2024