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 A179751 #7 Dec 26 2012 19:46:32 %S A179751 0,1,2,2,3,3,2,3,3,4,4,3,4,4,3,3,3,4,4,3,3,4,4,5,5,4,5,5,4,4,4,5,5,4, %T A179751 4,5,5,4,4,3,4,4,3,3,4,5,5,4,4,5,5,3,3,3,4,4,4,4,5,5,4,4,4,5,5,6,6,5, %U A179751 6,6,5,5,5,6,6,5,5,6,6,5,5,4,5,5,4,4,5,6,6,5,5,6,6,4,4,4,5,5,5,5,6,6 %N A179751 Maximum depth/height of binary trees encoded by A014486. %C A179751 Each integer n appears first at position given by A014137. %H A179751 A. Karttunen, <a href="/A179751/b179751.txt">Table of n, a(n) for n = 0..2055</a> %e A179751 The terms A014486[1..8] encode the following rooted plane binary trees: %e A179751 .1.......2.......3.......4.......5........6.......7.......8.. %e A179751 ...........................\/....\/...............\/....\/... %e A179751 ..........\/....\/........\/......\/....\/ \/....\/......\/.. %e A179751 .\/......\/......\/......\/......\/......\_/......\/......\/. %e A179751 thus a(1)=1, a(2)=2, a(3)=2, a(4)=3, a(5)=3, a(6)=2, a(7)=3, a(8)=3. %Y A179751 Cf. A179752. %K A179751 nonn %O A179751 0,3 %A A179751 _Antti Karttunen_, Aug 03 2010