login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331237 Total cutting number of all trees of order n. 5
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 15:07 EST 2020. Contains 338926 sequences. (Running on oeis4.)