A331237 Total cutting number of all trees of order n.

0, 0, 1, 5, 15, 47, 127, 363, 978, 2778, 7624, 21566, 60584, 172221, 488978, 1398457, 4001323, 11490717, 33037548, 95195793, 274609124, 793298293, 2294114542, 6641070332, 19241453969, 55795142707, 161910611244

Offset

1,4

Links

Table of n, a(n) for n=1..27.

Frank Harary and Peter J. Slater, A linear algorithm for the cutting center of a tree, Information Processing Letters, 23 (1986), 317-319.

Sean A. Irvine, Java program (github)

Formula

a(n) = Sum_{T} c(T) where the sum is over all trees with n vertices and c(T) is the cutting number of T.

a(n) = Sum_{k=0..(n-1)*(n-2)/2} A331238(n, k).

Crossrefs

Cf. A002887, A002888, A331236, A331238.

Sequence in context: A307242 A296545 A089040 * A184262 A126944 A077841

Adjacent sequences: A331234 A331235 A331236 * A331238 A331239 A331240

Keyword

nonn,more

Author

Sean A. Irvine, Jan 13 2020

Status

approved