|
Search: id:A126268
|
|
|
| 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. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
LINKS
|
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: A118816 A097289 A114115 this_sequence A097291 A029266 A127702
Adjacent sequences: A126265 A126266 A126267 this_sequence A126269 A126270 A126271
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
Serhat Sevki Dincer (mesti_mudam(AT)yahoo.com), Dec 22 2006
|
|
|
Search completed in 0.002 seconds
|
