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.

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

Offset

3,1

Links

Table of n, a(n) for n=3..35.

Wikipedia, Huffman Coding

Example

Possible huffman codes for n = 3,4,5 are:
1 : 00
2 : 01
3 : 1
1 : 100
2 : 101
3 : 11
4 : 0
1 : 000
2 : 001
3 : 01
4 : 10
5 : 11
so the triangle is:
row #3: 2,2,1
row #4: 3,3,2,1
row #5: 3,3,2,2,2
etc.

Crossrefs

Cf. A126014.

Sequence in context: A288267 A237840 A114115 * A193739 A345032 A182535

Adjacent sequences: A126265 A126266 A126267 * A126269 A126270 A126271

Keyword

easy,nonn,tabf

Author

Serhat Sevki Dincer (mesti_mudam(AT)yahoo.com), Dec 22 2006

Status

approved