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 A087080 #12 Oct 20 2020 08:20:40
%S A087080 0,1,4,12,20,52,60,148,196,300,332,780,828,1904,2080,2348,2812,6352,
%T A087080 6608,14736,15632,17456,18640,41152,42432,60912,64800,80928,85408,
%U A087080 186304,187584,406400,457344,497472,523456,585280,596288,1284224,1348032,1457792,1495424
%N A087080 Number of elements in the coprime subsets of the integers 1 to n.
%C A087080 A coprime set of integers has (m,n)=1 for each pair of integers in the set.
%D A087080 Alan Sutcliffe, Divisors and Common Factors in Sets of Integers, awaiting publication.
%H A087080 Fausto A. C. Cariboni, <a href="/A087080/b087080.txt">Table of n, a(n) for n = 0..120</a>
%e A087080 a(4)=20 since the 12 coprime subsets of (1,2,3,4) are ( ) (1) (2) (3) (4) (1,2) (1,3) (1,4) (2,3) (3,4) (1,2,3) (1,3 4) and these contain 20 elements.
%o A087080 (PARI) iscoprime(v) = {local(i); for (i=1, #v-1, for (j=i+1, #v, if (gcd(v[i], v[j]) != 1, return (0)););); return (1);}
%o A087080 a(n) = {sn = vector(n, i, i); pset = vector(1<<#sn, i, vecextract(sn, i-1)); nb = 0; for (i=1, #pset, if (iscoprime(pset[i]), nb += #pset[i]);); return (nb);} \\ _Michel Marcus_, Jul 12 2013
%Y A087080 A087077 gives the number of elements in the primitive subsets. A084422 gives the number coprime subsets. A087081 gives the sum of the elements in coprime subsets.
%K A087080 nonn
%O A087080 0,3
%A A087080 Alan Sutcliffe (alansut(AT)ntlworld.com), Aug 12 2003
%E A087080 Terms a(38) and beyond from _Fausto A. C. Cariboni_, Oct 20 2020