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 A074697 #17 Dec 24 2021 02:22:30 %S A074697 12,24,30,36,40,42,48,54,56,60,70,72,78,80,81,84,88,90,96,100,102,104, %T A074697 105,108,110,112,114,120,126,128,130,132,135,138,140,144,147,150,154, %U A074697 156,160,162,165,168,170,171,174,176,180,182,184,186,189,190,192,196 %N A074697 Fibonacci(k) has more than k divisors (k such that A000005(A000045(k)) > k). %H A074697 Amiram Eldar, <a href="/A074697/b074697.txt">Table of n, a(n) for n = 1..463</a> %t A074697 Select[Range[200],DivisorSigma[0,Fibonacci[#]]>#&] (* _Harvey P. Dale_, Aug 17 2019 *) %o A074697 (Python) %o A074697 from sympy import divisor_count,fibonacci %o A074697 def ok(n): return divisor_count(fibonacci(n)) > n %o A074697 print([k for k in range(197) if ok(k)]) # _Michael S. Branicky_, Dec 24 2021 %Y A074697 Cf. A000005, A000045, A063375. %K A074697 nonn %O A074697 1,1 %A A074697 _Benoit Cloitre_, Sep 03 2002