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 A348519 #21 Nov 15 2021 11:10:26
%S A348519 1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,17,18,20,24,25,26,32,48
%N A348519 Tetraphobe or 4-phobe numbers: integers that are not tetraphile numbers.
%C A348519 Tetraphile numbers are described in A348517.
%C A348519 The idea for this sequence comes from the French website Diophante (see link).
%C A348519 It is possible to generalize for "k-phile" or "k-phobe" numbers (see Crossrefs).
%C A348519 The set of k-phobe numbers is always finite, the smallest one is always 1; here, there exist 23 tetraphobe numbers and the largest one is 48.
%H A348519 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).
%e A348519 There are no 4 positive integers b_1 < b_2 < b_3 < b_4 such that b_1 divides b_2, b_2 divides b_3, b_3 divides b_4, and 17 = b_1 + b_2 + b_3 + b_4, hence 17 is a term.
%t A348519 Select[Range@48,Select[Select[IntegerPartitions[#,{4}],Length@Union@#==4&],And@@(IntegerQ/@Divide@@@Partition[#,2,1])&]=={}&] (* _Giorgos Kalogeropoulos_, Oct 24 2021 *)
%o A348519 (PARI) isok(k) = forpart(p=k, if (#Set(p) == 4, if (!(p[2] % p[1]) && !(p[3] % p[2]) && !(p[4] % p[3]), return(0))), , [4, 4]); return(1); \\ _Michel Marcus_, Nov 14 2021
%Y A348519 k-phile numbers: A160811 \ {5} (k=3), A348517 (k=4), A348518 (k=5).
%Y A348519 k-phobe numbers: A019532 (k=3), this sequence (k=4), A348520 (k=5).
%K A348519 nonn,fini,full
%O A348519 1,2
%A A348519 _Bernard Schott_, Oct 23 2021