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 A265691 #21 Dec 23 2015 17:57:19 %S A265691 1,1,2,1,2,3,1,2,4,1,2,3,5,1,2,3,6,1,2,3,4,7,1,2,4,8,1,2,3,6,9,1,2,3, %T A265691 5,10,1,2,3,4,7,11,1,2,3,6,12,1,2,3,5,8,13,1,2,3,4,7,14,1,2,3,5,10,15, %U A265691 1,2,4,8,16,1,2,4,8,9,17,1,2,3,6,9,18,1,2,3,4,8,11,19,1,2,3,5,10,20 %N A265691 Irregular triangle read by rows: row n gives lexicographically first addition chain of minimal length for n. %C A265691 The addition chains in this sequence for 1, 2, 3, 7 start respectively with 1, 1,2, 1,2,3, and 1,2,3,4. Are there minimal addition chains starting 1,2,3,4,5? 1,2,...,n for larger n? %C A265691 Needs a b-file. %e A265691 The table starts: %e A265691 1 %e A265691 1 2 %e A265691 1 2 3 %e A265691 1 2 4 %e A265691 1 2 3 5 %e A265691 1 2 3 6 %e A265691 1 2 3 4 7 %e A265691 1 2 4 8 %e A265691 ... %Y A265691 Cf. A265690 (row lengths), A265692 (largest). %K A265691 nonn,tabf,nice %O A265691 1,3 %A A265691 _Franklin T. Adams-Watters_, Dec 13 2015