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 A358392 #11 Nov 14 2022 11:47:41
%S A358392 1,1,2,3,7,9,19,27,46,63,113,148,253,345,539,734,1198,1580,2540,3417,
%T A358392 5233,7095,11190,14720,22988,31057,47168,63331,98233,129836,200689,
%U A358392 269165,406504,546700,838766,1108583,1700025,2281517,3437422,4597833,7023543,9308824,14198257,18982014,28556962
%N A358392 Number of nonempty subsets of {1, 2, ..., n} with GCD equal to 1 and containing the sum of any two elements whenever it is at most n.
%C A358392 Also, the number of distinct numerical semigroups that are generated by some subset of {1, 2, ..., n} and have a finite complement in the positive integers.
%H A358392 Max Alekseyev, <a href="/A358392/b358392.txt">Table of n, a(n) for n = 1..100</a>
%H A358392 Marcel K. Goh et al., <a href="https://mathoverflow.net/q/434477">Counting numerical semigroups by largest element of minimal generating set</a>, MathOverflow, 2022.
%F A358392 a(n) = Sum_{k=1..n} moebius(k) * A103580(floor(n/k)).
%Y A358392 Inverse Moebius transform of A103580.
%Y A358392 Cf. A007865, A050291, A051026, A085489, A139384, A151897, A308546, A326020, A326076, A326080, A326083, A326114.
%K A358392 nonn
%O A358392 1,3
%A A358392 _Max Alekseyev_, Nov 13 2022