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 A074698 #36 Jan 05 2025 19:51:37
%S A074698 1,24,48,60,64,96,128,192,256,336,384,512,576,768,1024,1536,1920,2048,
%T A074698 3072
%N A074698 Numbers k that divide the number of divisors of Fibonacci(k).
%C A074698 Are all numbers of the form 2^m*24 and 2^m*64, m >= 0, in the sequence?
%C A074698 This sequence is infinite (Luca, 2002). - _Amiram Eldar_, Jan 12 2022
%H A074698 Florian Luca, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/40-5/advanced40-5.pdf">Problem H-590</a>, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 40, No. 5 (2002), p. 472; <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/41-4/advanced41-4.pdf">Arithmetic Functions of Fibonacci Numbers</a>, Solution to Problem H-590 by J.-Ch. Schlage-Puchta and J. Spilker, ibid., Vol. 41, No. 4 (2002), pp. 382-384.
%p A074698 with(combinat): with(numtheory): a:=proc(n) if type(tau(fibonacci(n))/n,integer) then n fi end: seq(a(n),n=1..200); # _Emeric Deutsch_, Jan 30 2006
%t A074698 With[{nn=200},Select[Thread[{DivisorSigma[0,Fibonacci[Range[nn]]],Range[nn]}],Divisible[#[[1]],#[[2]]]&]][[All,2]] (* The program generates the first 8 terms of the sequence. To generate more, increase the value of nn but the program may take a long time to run. *) (* _Harvey P. Dale_, Feb 17 2021 *)
%o A074698 (PARI) isok(n) = ! (numdiv(fibonacci(n)) % n); \\ _Michel Marcus_, Sep 10 2017
%Y A074698 Cf. A000005, A000045, A063375.
%K A074698 nonn,more
%O A074698 1,2
%A A074698 _Benoit Cloitre_, Sep 03 2002
%E A074698 a(9) from _Emeric Deutsch_, Jan 30 2006
%E A074698 a(10)-a(19) from _Charles R Greathouse IV_, Nov 07 2016