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 A114838 #22 May 05 2024 19:21:34 %S A114838 70,81,104,105,136,148,152,164,182,186,195,207,212,244,246,254,259, %T A114838 289,291,292,298,305,319,326,332,344,365,367,403,404,423,445,447,451, %U A114838 458,478,489,511,517,519,526,533,537,543,554,565,566,597,605,679,681,685,698,699,701,721,723,725,737,745,746,749,753,758,766,767,785,813,817,831,842,871,879,901,905,914,955,967,973,985,998,1006,1007,1009,1043,1046,1051,1133,1139,1159,1167,1174,1175,1177,1191,1199,1207,1219 %N A114838 Indices of Fibonacci numbers with 7 distinct prime factors. %H A114838 Amiram Eldar, <a href="/A114838/b114838.txt">Table of n, a(n) for n = 1..112</a> %H A114838 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci and Lucas Factorizations</a>. %e A114838 a(1)=70 because the 70th Fibonacci number consists of 7 distinct prime factors (i.e., 190392490709135 = 5 x 11 x 13 x 29 x 71 x 911 x 141961). %t A114838 Select[Range[1220],PrimeNu[Fibonacci[#]]==7&] (* _Harvey P. Dale_, Sep 18 2020 *) %o A114838 (PARI) n=1;while(n<310,if(omega(fibonacci(n))==7,print1(n,", "));n++) %Y A114838 Cf. A114823-A114826, A114836-A114841. %Y A114838 Column k=7 of A303217. %K A114838 nonn %O A114838 1,1 %A A114838 _Shyam Sunder Gupta_, Feb 19 2006 %E A114838 More terms from _Ryan Propper_, Apr 26 2006 %E A114838 a(53)-a(98) from _Max Alekseyev_, Aug 18 2013