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 A275867 #27 Feb 16 2025 08:33:36
%S A275867 0,0,0,0,0,0,8,144,3552,131452,7840396,797524408
%N A275867 Number of simple disconnected asymmetric graph on n vertices.
%C A275867 For 2 < n < 12, a(n) = A124059(n-1) (connected asymmetric graphs). This is because the singleton is the only asymmetric graph with fewer than 6 vertices, so in a disconnected asymmetric graph with fewer than 12 vertices one connected component must be the singleton, and it cannot occur more than once. - _Falk Hüffner_, Jan 16 2020
%D A275867 1
%H A275867 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphAutomorphism.html">Graph Automorphism</a>
%H A275867 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IdentityGraph.html">Identity Graph</a>
%F A275867 a(n) = A003400(n) - A124059(n).
%t A275867 A[s_Integer] := With[{s6 = StringPadLeft[ToString[s], 6, "0"]}, Cases[ Import[ "https://oeis.org/A" <> s6 <> "/b" <> s6 <> ".txt", "Table"], {_, _}][[All, 2]]];
%t A275867 A003400 = A@003400;
%t A275867 A124059 = A@124059;
%t A275867 a[n_] := A003400[[n]] - A124059[[n]];
%t A275867 a /@ Range[12] (* _Jean-François Alcover_, Jan 07 2020 *)
%Y A275867 Cf. A003400 (not-necessarily connected simple asymmetric graphs).
%Y A275867 Cf. A124059 (connected simple asymmetric graphs).
%K A275867 nonn
%O A275867 1,7
%A A275867 _Eric W. Weisstein_, May 19 2017
%E A275867 a(12) from _Jean-François Alcover_, Jan 07 2020