Array read by antidiagonals: Costs E[m,N] of m-ary Huffman trees of maximum height with N internal nodes (non-leaves) for minimizing absolutely ordered sequences of size n=2N+1; m > 1, N > 0.

A098810

Array read by antidiagonals: Costs E[m,N] of m-ary Huffman trees of maximum height with N internal nodes (non-leaves) for minimizing absolutely ordered sequences of size n=2N+1; m > 1, N > 0.

Terms

    a(0) =2a(1) =6a(2) =3a(3) =13a(4) =10a(5) =4a(6) =25a(7) =25a(8) =14a(9) =5a(10) =45a(11) =56a(12) =39a(13) =18a(14) =6a(15) =78a(16) =119a(17) =97a(18) =55a(19) =22a(20) =7a(21) =132a(22) =246a(23) =233a(24) =148a(25) =73a(26) =26a(27) =8a(28) =220a(29) =501

External references