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