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 A065398 #20 Dec 04 2024 23:04:09
%S A065398 2,3,5,21,34,89,377,610,2584,17711,75025,121393,196418,514229,832040,
%T A065398 1346269,5702887,63245986,165580141,433494437,1134903170,2971215073,
%U A065398 20365011074,53316291173,86267571272,591286729879,2504730781961
%N A065398 Fibonacci numbers whose digits sum to a prime.
%H A065398 Harry J. Smith, <a href="/A065398/b065398.txt">Table of n, a(n) for n = 1..100</a>
%F A065398 a(n) = A000045(A178837(n)).
%t A065398 Select[Fibonacci[Range[100]],PrimeQ[Total[IntegerDigits[#]]]&] (* _Harvey P. Dale_, Mar 24 2017 *)
%o A065398 (PARI) { for (m=1, 10^2, my(f=fibonacci(m)); if (isprime(sumdigits(f)), print1(f, ", "))) } \\ _Harry J. Smith_, Oct 18 2009
%Y A065398 Cf. A000045, A178837 (corresponding indices).
%K A065398 base,easy,nonn
%O A065398 1,1
%A A065398 _Jason Earls_, Nov 22 2001