Minimal degree path length of a tree with n leaves.

Terms

a(0) =0a(1) =4a(2) =9a(3) =16a(4) =23a(5) =30a(6) =38a(7) =46a(8) =54a(9) =64a(10) =74a(11) =84a(12) =94a(13) =104a(14) =114a(15) =124a(16) =134a(17) =144a(18) =155a(19) =166a(20) =177a(21) =188a(22) =199a(23) =210a(24) =221a(25) =232a(26) =243a(27) =256a(28) =269a(29) =282