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 A019532 #28 Jul 08 2025 07:32:11
%S A019532 1,2,3,4,5,6,8,12,24
%N A019532 Numbers k such that Fibonacci(k) divides k!.
%C A019532 These terms m are called “triphobe” or “3-phobe” numbers, by the French website Diophante (see link), because there are no 3 positive integers b_1 < b_2 < b_3 such that b_1 divides b_2, b_2 divides b_3, and m = b_1 + b_2 + b_3. A number that is not “triphobe” is called “triphile” or “3-phile” (A160811). The set of k-phobe numbers is always finite, there exist 9 triphobe numbers and the largest one is 24. - _Bernard Schott_, Oct 23 2021
%D A019532 Posting to math-fun(AT)cs.arizona.edu by R. W. Gosper Nov 06 1996.
%H A019532 Diophante, <a href="http://www.diophante.fr/problemes-par-themes/arithmetique-et-algebre/a4-equations-diophantiennes/3143-a496-pentaphiles-et-pentaphobes">A496 - Pentaphiles et pentaphobes</a> (in French).
%t A019532 Select[Range[30],Divisible[#!,Fibonacci[#]]&] (* _Harvey P. Dale_, Jun 14 2020 *)
%Y A019532 k-phobe numbers: this sequence (k=3), A348519 (k=4), A348520 (k=5).
%Y A019532 k-phile numbers: A160811 \ {5} (k=3), A348517 (k=4), A348518 (k=5).
%Y A019532 Cf. A000045, A000142, A160811.
%K A019532 nonn,fini,full
%O A019532 1,2
%A A019532 _N. J. A. Sloane_
%E A019532 Offset changed to 1 by _David A. Corneth_, Oct 27 2021