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 A116511 #2 Mar 31 2012 13:21:30 %S A116511 1,0,1,0,0,1,1,0,0,0,1,2,2,0,1,0,0,0,0,1,3,5,5,3,4,0,3,0,0,0,1,0,0,0, %T A116511 0,0,1,4,9,14,17,15,17,10,14,4,10,2,7,0,6,0,0,0,4,0,0,0,0,0,0,0,1,0,0, %U A116511 0,0,0,0,1,5,14,28,45,60,67,78,66,81,51,73,33,65,29,40,4,47,14,24,5,23,0,12 %N A116511 Table T(n,k) = number of strictly increasing addition chains of length n whose final value is k. %C A116511 Row n has 2^(n-1) entries (starting with n-1 zeros). %e A116511 Table starts: %e A116511 1, %e A116511 0,1, %e A116511 0,0,1,1, %e A116511 0,0,0,1,2,2,0,1, %e A116511 0,0,0,0,1,3,5,5,3,4,0,3,0,0,0,1, %Y A116511 Row sums A008933, column sums A008928. %K A116511 nonn,tabl %O A116511 1,12 %A A116511 _Franklin T. Adams-Watters_, Mar 22 2006