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 A135953 #12 Oct 23 2024 16:33:44
%S A135953 4181,1346269,165580141,53316291173,956722026041,2504730781961,
%T A135953 308061521170129,806515533049393,14472334024676221,
%U A135953 1779979416004714189,573147844013817084101,10284720757613717413913,26925748508234281076009
%N A135953 (Nonprime Fibonacci numbers with prime indices) that have exactly 2 prime factors.
%C A135953 Conjecture: All numbers in this sequence are products of two sums of two squares, e.g. 4181 = 37*113 = (1^2+6^2)*(7^2+8^2), 1346269 = 557*2417 = (14^2+19^2)*(4^2+49^2).
%H A135953 Amiram Eldar, <a href="/A135953/b135953.txt">Table of n, a(n) for n = 1..42</a>
%t A135953 k = {}; Do[If[ !PrimeQ[Fibonacci[Prime[n]]], c = Length[FactorInteger[Fibonacci[Prime[n]]]]; If[c == 2, AppendTo[k, Fibonacci[Prime[n]]]]], {n, 1, 50}]; k
%t A135953 Select[Fibonacci[Prime[Range[30]]],PrimeOmega[#]==2&] (* _Harvey P. Dale_, Feb 18 2012 *)
%Y A135953 Cf. A000045, A001605, A050937, A075737, A090819, A134787, A134851, A134852, A135954, A135955, A135956, A135957.
%K A135953 nonn
%O A135953 1,1
%A A135953 _Artur Jasinski_, Dec 08 2007