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.

A377649 Number of edge cuts in the complete bipartite graph K_n,n.

Original entry on oeis.org

1, 11, 307, 29219, 9874531, 12425270531, 60192210392707, 1137427102035774659, 84343238614611474677731, 24650360937055503837110148611, 28488029177253725394061756995395587, 130493124785564166325712467713764904289859, 2373201513573386990964332212910033418138729872611
Offset: 1

Views

Author

Eric W. Weisstein, Nov 03 2024

Keywords

Crossrefs

Cf. A005333, A048291 (edge covers), A379215.

Formula

a(n) = 2^(n^2) - A005333(n). - Andrew Howroyd, Dec 18 2024

Extensions

a(6) onwards from Andrew Howroyd, Dec 18 2024