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.

A378936 Number of minimal edge cuts in the n X n rook graph.

This page as a plain text file.
%I A378936 #7 Feb 16 2025 08:34:07
%S A378936 0,6,150,23214,14673870,32893769886,277707579785790,
%T A378936 9185104346133530814,1207381826962079773424430,
%U A378936 633579118339962549031587426846,1329073084589877793324888678089108990,11149987705045482483752338599907193464092414,374140639230104433076704980495741968217315823513390
%N A378936 Number of minimal edge cuts in the n X n rook graph.
%H A378936 Andrew Howroyd, <a href="/A378936/b378936.txt">Table of n, a(n) for n = 1..50</a>
%H A378936 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalEdgeCut.html">Minimal Edge Cut</a>.
%H A378936 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RookGraph.html">Rook Graph</a>.
%F A378936 a(n) = A286189(n) + (2^(n-1)-1)^2 - 2^(n^2-1).
%Y A378936 Main diagonal of A378935.
%Y A378936 Cf. A286189.
%K A378936 nonn
%O A378936 1,2
%A A378936 _Andrew Howroyd_, Dec 12 2024