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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A331237 Total cutting number of all trees of order n. 5

%I

%S 0,0,1,5,15,47,127,363,978,2778,7624,21566,60584,172221,488978,

%T 1398457,4001323,11490717,33037548,95195793,274609124,793298293,

%U 2294114542,6641070332,19241453969,55795142707,161910611244

%N Total cutting number of all trees of order n.

%H Frank Harary and Peter J. Slater, <a href="https://doi.org/10.1016/0020-0190(86)90093-1">A linear algorithm for the cutting center of a tree</a>, Information Processing Letters, 23 (1986), 317-319.

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a331/A331237.java">Java program</a> (github)

%F 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.

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

%Y Cf. A002887, A002888, A331236, A331238.

%K nonn,more

%O 1,4

%A _Sean A. Irvine_, Jan 13 2020

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.

Last modified January 16 06:04 EST 2021. Contains 340195 sequences. (Running on oeis4.)