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