1,1

Minimal cost of maximum height Huffman tree of size n for strictly "worst case height" sequences. (A strictly "worst case height" sequence generates only maximum height Huffman trees; a non-strictly "worst case height" sequence can generate also non-maximum height Huffman trees.) - Alex Vinokur (alexvn(AT)barak-online.net), Oct 26 2004

Record-positions for A107910: A107910(a(n+2))=A005578(n), A107910(m)<A005578(n) for m<a(n+2). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 28 2005

Vinokur A. B., Huffman trees and Fibonacci numbers, Kibernetika Issue 6 (1986) 9-12 (in Russian); English translation in Cybernetics 21, Issue 6 (1986), 692-696.

Alex Vinokur, Fibonacci connection between Huffman codes and Wythoff array, E-print

a(n)=4*(F(n+1)-1)+3*F(n)-n; F(n)=A000045 (Fibonacci): G.F. x*(2-x)/((1-x-x^2)*(1-x)^2). Also convolution of natural numbers n >= 1 with Lucas numbers (A000032) - from Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)

For n>=1, a(n)=L(n+3)-(n+4), where L(n) are Lucas numbers. - Mario Catalani (mario.catalani(AT)unito.it), Jul 22 2004

Fib(n+3)+F(n+1)-(n+3) for n > 1. - Alex Vinokur (alexvn(AT)barak-online.net), Oct 26 2004

Cf. A006327.

Sequence in context: A112805 A119970 A082775 this_sequence A000785 A049936 A058358

Adjacent sequences: A023545 A023546 A023547 this_sequence A023549 A023550 A023551

nonn

Clark Kimberling (ck6(AT)evansville.edu)