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 A136341 #17 Mar 29 2022 15:40:14
%S A136341 2,3,13,21,34,55,233,17711
%N A136341 Fibonacci primes or semiprimes F(k) such that F(k+1) is again prime or semiprime.
%C A136341 By definition, the smaller number in a pair of two consecutive Fibonacci numbers in A061305. a(9), if it exists, is >= A000045(230), so it has at least 48 digits. [_R. J. Mathar_, Feb 06 2010]
%C A136341 A search for consecutive numbers in the union of A072381 and A001605 shows that a(9) must be larger than A000045(990), a number with 207 digits, if it exists. [_R. J. Mathar_, Jun 02 2010]
%F A136341 Let F(n) = n-th Fibonacci number and define a 2-almost prime number to be a number with only 2 prime divisors with multiplicity.
%e A136341 (55,89) is an almost twin Fibonacci prime pair because 55=5*11 is a 2-almost prime and 89 is prime.
%t A136341 Fibonacci[#]&/@(SequencePosition[Table[If[PrimeOmega[f]<=2,1,0],{f,Fibonacci[ Range[150]]}],{1,1}][[All,1]]) (* _Harvey P. Dale_, Mar 29 2022 *)
%o A136341 (PARI) ATfib(n) = for(x=3,n,f1=fibonacci(x);f2=fibonacci(x+1);if(bigomega (f1)<=2&&bigomega(f2)<=2, print1(f1",")))
%o A136341 (PARI) for( k=3,10^5, bigomega( fibonacci( k++ ))>2 & next; bigomega( fibonacci( k-1 ))>2 & next; print1(fibonacci(k--)",")) \\ _M. F. Hasler_, May 01 2008
%Y A136341 Cf. A001358.
%Y A136341 Cf. A053409, A005478. [_R. J. Mathar_, Jun 02 2010]
%Y A136341 Cf. A001605, A072381, A278637.
%K A136341 nonn,more
%O A136341 1,1
%A A136341 _Cino Hilliard_, Mar 28 2008
%E A136341 Edited by _M. F. Hasler_, May 01 2008