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 A114812 #30 May 05 2024 19:19:00
%S A114812 6,15,16,21,25,33,35,37,38,39,46,49,51,58,62,65,67,82,86,103,106,119,
%T A114812 122,139,142,145,158,166,179,181,226,233,235,241,257,263,274,281,299,
%U A114812 301,317,337,383,389,419,457,463,473,479,491,521,541,557,619,643,659
%N A114812 Indices of Fibonacci numbers with 3 prime factors when counted with multiplicity.
%C A114812 1811, 1933, 1997, 2069, 2087, 2203, 2221, 2311, 2663, 2713, 3631, 4157, 4651, 5107, 6701, 7211, 8123 are also terms (from data in Kelly link). - _Chai Wah Wu_, Nov 11 2019
%H A114812 Amiram Eldar, <a href="/A114812/b114812.txt">Table of n, a(n) for n = 1..83</a>
%H A114812 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci and Lucas Factorizations</a>.
%F A114812 {n: A038575(n)=3}. [_R. J. Mathar_, Jun 08 2010]
%e A114812 a(2)=15 because 15th Fibonacci number (i.e., 610) consists of 3 prime factors (i.e., 2*5*61).
%t A114812 t = {}; Do[f = FactorInteger[Fibonacci[n]]; If[Total[Transpose[f][[2]]] == 3, AppendTo[t, n]], {n, 2, 100}]; t (* _T. D. Noe_, Mar 14 2014 *)
%t A114812 Flatten[Position[Fibonacci[Range[700]],_?(PrimeOmega[#]==3&)]] (* _Harvey P. Dale_, Feb 15 2015 *)
%o A114812 (PARI) n=1;while(n<340,if(bigomega(fibonacci(n))==3,print1(n,", "));n++)
%Y A114812 Cf. A072381, A114813.
%Y A114812 Column k=3 of A303215.
%K A114812 nonn
%O A114812 1,1
%A A114812 _Shyam Sunder Gupta_, Feb 19 2006
%E A114812 More terms from _Ryan Propper_, May 22 2006