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 A264802 #13 Dec 23 2015 02:55:33 %S A264802 2,4,3,8,6,5,16,12,10,9,32,24,20,18,17,64,48,40,36,34,33,128,96,80,72, %T A264802 68,66,65,256,192,160,144,136,132,130,129,512,384,320,288,272,264,260, %U A264802 258,257 %N A264802 Position of the n largest occurrences of a shortest addition chain of length n in A003313, written as a triangle. %C A264802 The terms are given with latest occurrence first, which corresponds to the addition chain of length n for the number 2^n. %e A264802 Triangle of the n latest occurrences: %e A264802 2 %e A264802 4 3 %e A264802 8 6 5 %e A264802 16 12 10 9 %e A264802 32 24 20 18 17 %e A264802 64 48 40 36 34 33 %e A264802 128 96 80 72 68 66 65 %e A264802 256 192 160 144 136 132 130 129 %e A264802 512 384 320 288 272 264 260 258 257 %Y A264802 Cf. A003313. %K A264802 nonn,tabl,easy %O A264802 1,1 %A A264802 _Hugo Pfoertner_, Dec 17 2015