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

A378924
Number of minimal edge cuts in the n-Plummer-Toft graph.
0
12, 22, 38, 65, 113, 202, 372, 703, 1355, 2648, 5222, 10357, 20613, 41110, 82088, 164027, 327887, 655588, 1310970, 2621713, 5243177, 10486082, 20971868, 41943415, 83886483, 167772592, 335544782, 671089133, 1342177805, 2684355118, 5368709712, 10737418867
OFFSET
0,1
COMMENTS
The sequence has been extended to n=0 using the formula. - Andrew Howroyd, Dec 11 2024
LINKS
Eric Weisstein's World of Mathematics, Minimal Edge Cut.
Eric Weisstein's World of Mathematics, Plummer-Toft Graph.
FORMULA
From Andrew Howroyd, Dec 11 2024: (Start)
a(n) = 5*2^n + (n+2)*(n+7)/2.
G.f.: (12 - 38*x + 36*x^2 - 11*x^3)/((1 - x)^3*(1 - 2*x)). (End)
PROG
(PARI) a(n) = (n+2)*(n+7)/2 + 5*2^n \\ Andrew Howroyd, Dec 11 2024
CROSSREFS
Cf. A377769.
Sequence in context: A124885 A115745 A375084 * A129639 A153361 A200197
KEYWORD
nonn,easy,new
AUTHOR
Eric W. Weisstein, Dec 11 2024
EXTENSIONS
a(0)=12 prepended and a(8) onwards from Andrew Howroyd, Dec 11 2024
STATUS
approved