A378923 Number of minimal edge cuts in the n-cycle complement graph.

0, 2, 10, 22, 49, 111, 237, 491, 1001, 2023, 4069, 8163, 16353, 32735, 65501, 131035, 262105, 524247, 1048533, 2097107, 4194257, 8388559, 16777165, 33554379, 67108809, 134217671, 268435397, 536870851, 1073741761, 2147483583, 4294967229, 8589934523, 17179869113

Offset

3,2

Links

Andrew Howroyd, Table of n, a(n) for n = 3..1000

Eric Weisstein's World of Mathematics, Cycle Complement Graph.

Eric Weisstein's World of Mathematics, Minimal Edge Cut.

Index entries for linear recurrences with constant coefficients, signature (4,-5,2).

Formula

From Andrew Howroyd, Dec 11 2024: (Start)

a(n) = 2^(n-1) - 2*n - 1 for n >= 7.

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)

Prog

(PARI) a(n)=if(n<7, [0, 2, 10, 22][n-2], 2^(n-1) - 2*n - 1) \\ Andrew Howroyd, Dec 11 2024

Crossrefs

Sequence in context: A096183 A218612 A218548 * A079605 A075222 A333703

Adjacent sequences: A378919 A378920 A378922 * A378924 A378932 A378933

Keyword

nonn,easy,new

Author

Eric W. Weisstein, Dec 11 2024

Extensions

a(10) onwards from Andrew Howroyd, Dec 11 2024

Status

approved