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 A325869 #4 Jun 02 2019 23:39:58
%S A325869 1,1,1,2,3,4,6,6,6,20,32,29,57,83,113,183,373,233,549,360
%N A325869 Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient.
%e A325869 The a(1) = 1 through a(7) = 6 subsets:
%e A325869 {1} {1,2} {1,2,3} {1,3,4} {1,2,3,5} {1,2,5,6} {1,2,3,5,7}
%e A325869 {2,3,4} {1,3,4,5} {2,3,5,6} {1,2,5,6,7}
%e A325869 {2,3,4,5} {2,4,5,6} {2,3,4,5,7}
%e A325869 {1,3,4,5,6} {2,3,5,6,7}
%e A325869 {2,4,5,6,7}
%e A325869 {1,3,4,5,6,7}
%t A325869 fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&)/@y];
%t A325869 Table[Length[fasmax[Select[Subsets[Range[n]],MemberQ[#,n]&&UnsameQ@@Divide@@@Subsets[#,{2}]&]]],{n,10}]
%Y A325869 Cf. A025582, A067992, A108917, A143823, A196723, A196724.
%Y A325869 Cf. A325853, A325854, A325858, A325860, A325861, A325864, A325868.
%K A325869 nonn,more
%O A325869 1,4
%A A325869 _Gus Wiseman_, Jun 02 2019