Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Dec 11 2024 15:05:14
%S 0,2,10,22,49,111,237,491,1001,2023,4069,8163,16353,32735,65501,
%T 131035,262105,524247,1048533,2097107,4194257,8388559,16777165,
%U 33554379,67108809,134217671,268435397,536870851,1073741761,2147483583,4294967229,8589934523,17179869113
%N Number of minimal edge cuts in the n-cycle complement graph.
%H Andrew Howroyd, <a href="/A378923/b378923.txt">Table of n, a(n) for n = 3..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CycleComplementGraph.html">Cycle Complement Graph</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalEdgeCut.html">Minimal Edge Cut</a>.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,2).
%F From _Andrew Howroyd_, Dec 11 2024: (Start)
%F a(n) = 2^(n-1) - 2*n - 1 for n >= 7.
%F G.f.: x^4*(2 + 2*x - 8*x^2 + 7*x^3 + 5*x^4 - 6*x^5)/((1 - x)^2*(1 - 2*x)). (End)
%o (PARI) a(n)=if(n<7, [0, 2, 10, 22][n-2], 2^(n-1) - 2*n - 1) \\ _Andrew Howroyd_, Dec 11 2024
%K nonn,easy,new
%O 3,2
%A _Eric W. Weisstein_, Dec 11 2024
%E a(10) onwards from _Andrew Howroyd_, Dec 11 2024