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 A114819 #20 May 05 2024 19:21:04
%S A114819 36,100,114,165,174,256,266,273,282,296,304,322,325,366,369,376,406,
%T A114819 424,428,429,484,494,506,574,578,589,633,637,642,646,652,658,663,664,
%U A114819 668,669,670,687,705,716,724,742,754,779,782,807,845,892,909,921,946,956
%N A114819 Indices of Fibonacci numbers with 10 prime factors when counted with multiplicity.
%H A114819 Amiram Eldar, <a href="/A114819/b114819.txt">Table of n, a(n) for n = 1..71</a>
%H A114819 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci and Lucas Factorizations</a>.
%e A114819 a(1)=36 because the 36th Fibonacci number (i.e., 14930352) consists of 10 prime factors (i.e., 2*2*2*2*3*3*3*17*19*107).
%t A114819 t = {}; Do[f = FactorInteger[Fibonacci[n]]; If[Total[Transpose[f][[2]]] == 10, AppendTo[t, n]], {n, 2, 200}]; t (* _T. D. Noe_, Mar 14 2014 *)
%t A114819 Select[Range[1000],PrimeOmega[Fibonacci[#]]==10&] (* _Harvey P. Dale_, Jul 24 2021 *)
%o A114819 (PARI) n=1;while(n<305,if(bigomega(fibonacci(n))==10,print1(n,", "));n++)
%Y A114819 Column k=10 of A303215.
%K A114819 nonn
%O A114819 1,1
%A A114819 _Shyam Sunder Gupta_, Feb 19 2006
%E A114819 More terms from _Ryan Propper_, May 24 2006