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 A058222 #11 Jul 29 2022 09:57:35 %S A058222 1,2,3,4,4,5,6,5,6,7,8,5,6,7,8,6,7,8,9,10,7,8,9,10,11,12,6,7,8,9,10,7, %T A058222 8,9,10,11,12,8,9,10,11,12,13,14,9,10,11,12,13,14,15,16,6,7,8,9,10,7, %U A058222 8,9,10,11,12,8,9,10,11,12,13,14,9,10,11,12,13,14,15,16,7,8,9 %N A058222 Tree of tournament sequences read across rows. %H A058222 Sean A. Irvine, <a href="/A058222/b058222.txt">Table of n, a(n) for n = 0..10000</a> %H A058222 M. Cook and M. Kleber, <a href="https://doi.org/10.37236/1522">Tournament sequences and Meeussen sequences</a>, Electronic J. Comb. 7 (2000), #R44. %F A058222 Top node is 1; each node k has children labeled k+1, k+2, ..., 2k at next level. %e A058222 Irregular triangle begins: %e A058222 1; %e A058222 2; %e A058222 3,4; %e A058222 4,5,6,5,6,7,8; %e A058222 ... %Y A058222 A008934 gives number of children at level n. Cf. A058223. %Y A058222 Cf. A002083. %K A058222 nonn,easy,nice,tabf %O A058222 0,2 %A A058222 _N. J. A. Sloane_, Dec 02 2000