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 A378862 #17 Dec 12 2024 15:15:24 %S A378862 0,1,5,4,70,31,972,293,14476,3326,237575,44189,4305960,673471, %T A378862 85836485,11588884,1871150248,222304897 %N A378862 Number of minimum edge covers in the n-cycle complement graph. %C A378862 For even n, the minimum edge covers are perfect matchings. - _Andrew Howroyd_, Dec 10 2024 %H A378862 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CycleComplementGraph.html">Cycle Complement Graph</a>. %H A378862 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumEdgeCover.html">Minimum Edge Cover</a>. %F A378862 a(2*n) = A003436(n). - _Andrew Howroyd_, Dec 10 2024 %F A378862 a(2*n+1) = (n-1)*(2*n+1)*A278990(n). - _Detlef Meya_, Dec 12 2024 %Y A378862 Cf. A003436, A278990, A351587, A356212. %K A378862 nonn,more %O A378862 3,3 %A A378862 _Eric W. Weisstein_, Dec 09 2024 %E A378862 a(10)-a(20) from _Andrew Howroyd_, Dec 10 2024