cp's OEIS Frontend

A126268 Triangle read by rows: row n gives lengths of Huffman codes with n (>= 3) symbols, where symbol[k] has frequency k (k=1,..,n), in increasing k.

%I A126268 #1 Jan 12 2007 03:00:00
%S A126268 2,2,1,3,3,2,1,3,3,2,2,2,4,4,3,2,2,2,4,4,3,3,3,2,2,5,5,4,3,3,3,2,2
%N A126268 Triangle read by rows: row n gives lengths of Huffman codes with n (>= 3) symbols, where symbol[k] has frequency k (k=1,..,n), in increasing k.
%H A126268 Wikipedia, <a href="http://en.wikipedia.org/wiki/Huffman_coding">Huffman Coding</a>
%e A126268 Possible huffman codes for n = 3,4,5 are:
%e A126268 1 : 00
%e A126268 2 : 01
%e A126268 3 : 1
%e A126268 1 : 100
%e A126268 2 : 101
%e A126268 3 : 11
%e A126268 4 : 0
%e A126268 1 : 000
%e A126268 2 : 001
%e A126268 3 : 01
%e A126268 4 : 10
%e A126268 5 : 11
%e A126268 so the triangle is:
%e A126268 row #3: 2,2,1
%e A126268 row #4: 3,3,2,1
%e A126268 row #5: 3,3,2,2,2
%e A126268 etc.
%Y A126268 Cf. A126014.
%K A126268 easy,nonn,tabf
%O A126268 3,1
%A A126268 Serhat Sevki Dincer (mesti_mudam(AT)yahoo.com), Dec 22 2006