cp's OEIS Frontend

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.

A328889 Number of acyclic edge covers of the complete bipartite graph K_{n,n}.

This page as a plain text file.
%I A328889 #10 Feb 16 2025 08:33:58
%S A328889 1,6,132,6728,632970,96208632,21634786586,6765592120576,
%T A328889 2811089200308642,1498814096387846600,997811910708863804202,
%U A328889 811362765374061475234464,791392079095826028308709026,912043721764132114072259699656,1226095938791120621169019081161450
%N A328889 Number of acyclic edge covers of the complete bipartite graph K_{n,n}.
%H A328889 Andrew Howroyd, <a href="/A328889/b328889.txt">Table of n, a(n) for n = 1..100</a>
%H A328889 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteBipartiteGraph.html">Complete Bipartite Graph</a>
%Y A328889 Main diagonal of A328888.
%Y A328889 Cf. A068087 (spanning trees).
%Y A328889 Cf. A297077 (not necessarily covering edge sets).
%K A328889 nonn
%O A328889 1,2
%A A328889 _Andrew Howroyd_, Oct 29 2019