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 A325868 #16 Oct 17 2020 02:33:30 %S A325868 1,2,4,6,14,24,52,84,120,240,548,688,1784,2600,4236,5796,16200,17568, %T A325868 49968,55648,101360,176792,433736,430032,728784,1360928,2304840, %U A325868 2990856,8682912,7877376,25243200,27946656,46758912,81457248,121546416,114388320,442583952 %N A325868 Number of subsets of {1..n} containing n such that every ordered pair of distinct elements has a different quotient. %H A325868 Fausto A. C. Cariboni, <a href="/A325868/b325868.txt">Table of n, a(n) for n = 1..50</a> %e A325868 The a(1) = 1 through a(5) = 14 subsets: %e A325868 {1} {2} {3} {4} {5} %e A325868 {1,2} {1,3} {1,4} {1,5} %e A325868 {2,3} {2,4} {2,5} %e A325868 {1,2,3} {3,4} {3,5} %e A325868 {1,3,4} {4,5} %e A325868 {2,3,4} {1,2,5} %e A325868 {1,3,5} %e A325868 {1,4,5} %e A325868 {2,3,5} %e A325868 {2,4,5} %e A325868 {3,4,5} %e A325868 {1,2,3,5} %e A325868 {1,3,4,5} %e A325868 {2,3,4,5} %t A325868 Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&UnsameQ@@Divide@@@Subsets[#,{2}]&]],{n,10}] %Y A325868 Cf. A025582, A108917, A143823, A196723, A196724. %Y A325868 Cf. A325853, A325854, A325858, A325860, A325861, A325864, A325869. %K A325868 nonn %O A325868 1,2 %A A325868 _Gus Wiseman_, Jun 02 2019 %E A325868 a(21)-a(37) from _Fausto A. C. Cariboni_, Oct 16 2020