This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A126014 #7 Oct 19 2017 03:15:05 %S A126014 2,3,2,2,3,2,5,2,6,3,2,8,3,2,9,5,2,5,2,6,3,2,8,3,2,9,5,2,11,5,2,12,6, %T A126014 3,2,14,6,3,2,15,8,3,2,17,8,3,2,18,9,5,2,20,9,5,2,21,11,5,2,11,5,2,12, %U A126014 6,3,2,14,6,3,2,15,8,3,2,17,8,3,2,18,9,5,2,20,9,5,2,21,11,5,2 %N A126014 Triangle read by rows, based on Huffman encoding. See comments. %C A126014 Row #n pertains to Huffman encoding of n symbols, where the k-th symbol has frequency k. Let b(k) be the number of bits used to encode the symbol of frequency k. The row has the values of k such that b(k)>b(k+1). %C A126014 Each row is ordered descendingly; each ends with '2'. Row #3 is first. %H A126014 Wikipedia, <a href="http://en.wikipedia.org/wiki/Huffman_coding">Huffman coding</a> %e A126014 In row #8, the frequencies are 1,2,3,4,5,6,7,8 and a Huffman encoding is (1->00000, 2->00001, 3->0001, 4->001, 5->010, 6->011, 7->10, 8->11). The codes shrink after k=6,3,2; so row #8 has 6,3,2. %e A126014 2; 3,2; 2; 3,2; 5,2; 6,3,2; 8,3,2; 9,5,2; 5,2; 6,3,2; 8,3,2; ... %Y A126014 The length of the n-th row is in A126237. The minimum and maximum lengths of codewords are in A126235 and A126236. %K A126014 nonn,tabf %O A126014 1,1 %A A126014 Serhat Sevki Dincer (mesti_mudam(AT)yahoo.com), Dec 14 2006 %E A126014 Edited by _Don Reble_, Dec 17 2006 and _Dean Hickerson_, Dec 21 2006