%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/00200190(86)900931">A linear algorithm for the cutting center of a tree</a>, Information Processing Letters, 23 (1986), 317319.
%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..(n1)*(n2)/2} A331238(n, k).
%Y Cf. A002887, A002888, A331236, A331238.
%K nonn,more
%O 1,4
%A _Sean A. Irvine_, Jan 13 2020
