login

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”).

A378933
Number of minimal edge cuts in the 3 X n grid graph.
0
2, 15, 53, 146, 356, 809, 1759, 3716, 7702, 15763, 31993, 64582, 129912, 260749, 522627, 1046616, 2094858, 4191639, 8385533, 16773690, 33550412, 67104305, 134212583, 268429676, 536864446, 1073734619, 2147475649, 4294958446, 8589924832, 17179858453
OFFSET
1,1
FORMULA
a(n) = 16*2^n - (2*n^3 + 9*n^2 + 73*n + 96)/6.
G.f.: x*(2 + 3*x - 9*x^2 + 6*x^3)/((1 - 2*x)*(1 - x)^4).
a(n) = A166761(n)/2.
PROG
(PARI) a(n) = {16*2^n - (2*n^3 + 9*n^2 + 73*n + 96)/6}
CROSSREFS
Row 3 of A378932.
Sequence in context: A015520 A098520 A216333 * A056078 A142861 A305673
KEYWORD
nonn,easy,new
AUTHOR
Andrew Howroyd, Dec 11 2024
STATUS
approved