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 A075545 #23 Feb 16 2025 08:32:47
%S A075545 1,1,1,2,2,5,3,8,6,16,7,38,13,43,40,72,35,178,59,314,195,407,187,1256,
%T A075545 420,1385,920,3054,1181,8702,2191,8280,6759,16423,11138,46552,14601,
%U A075545 58227,44409,135784,52487,354951,99879,432158,351374,762419,364723,2121560,798948,3355968
%N A075545 Number of connected circulant graphs on n nodes.
%C A075545 Computed by _Brendan McKay_.
%H A075545 Jean-François Alcover, <a href="/A075545/b075545.txt">Table of n, a(n) for n = 1..70</a> [after _Andrew Howroyd_ for A049287 data]
%H A075545 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CirculantGraph.html">Circulant Graph</a>
%F A075545 Moebius transform of A049287. - _Andrew Howroyd_, Nov 04 2017
%t A075545 CountDistinct /@ Table[Select[CanonicalGraph[CirculantGraph[n, #]] & /@ Subsets[Range[Floor[n/2]]], ConnectedGraphQ], {n, 25}] (* _Eric W. Weisstein_, May 13 2017 *)
%t A075545 A049287 = Cases[Import["https://oeis.org/A049287/b049287.txt", "Table"], {_, _}][[All, 2]];
%t A075545 a[n_] := Sum[MoebiusMu[n/d] A049287[[d]], {d, Divisors[n]}];
%t A075545 a /@ Range[70] (* _Jean-François Alcover_, Jan 11 2020 *)
%Y A075545 Cf. A049287.
%K A075545 nonn
%O A075545 1,4
%A A075545 _Eric W. Weisstein_, Sep 22 2002
%E A075545 a(1) changed to 1 by _Andrew Howroyd_, Apr 24 2017
%E A075545 a(41)-a(50) from _Andrew Howroyd_, Nov 04 2017