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.

A359989 Number of edge cuts in the n X n grid graph.

This page as a plain text file.
%I A359989 #7 Feb 16 2025 08:34:04
%S A359989 0,11,3665,16222021,1089224690733,1150229180575982641,
%T A359989 19332960184149905415396841,5191795779341747010730275139276101,
%U A359989 22300392508126626453613075681944644703634073,1532492114568208344599582951444206568577948454351297761
%N A359989 Number of edge cuts in the n X n grid graph.
%H A359989 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EdgeCut.html">Edge Cut</a>
%H A359989 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%F A359989 a(n) = A053765(n) - A359992(n).
%e A359989 The a(2) = 11 edge cuts are the following subgraphs and their rotations and reflections. The illustrations show the edge sets that must be removed to disconnect the graph.
%e A359989     o---o    o---o   o---o   o---o
%e A359989     |                |       |   |
%e A359989     o   o    o---o   o---o   o---o
%e A359989 The first two of these show minimal edge cuts.
%Y A359989 Main diagonal of A359990.
%Y A359989 Cf. A053765, A286913, A359992.
%K A359989 nonn
%O A359989 1,2
%A A359989 _Andrew Howroyd_, Jan 28 2023