A058222 Tree of tournament sequences read across rows.

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, 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, 8, 9, 10, 11, 12, 8, 9, 10, 11, 12, 13, 14, 9, 10, 11, 12, 13, 14, 15, 16, 7, 8, 9

Offset: 0

Author

N. J. A. Sloane, Dec 02 2000

Keywords

• nonn
• easy
• nice
• tabf

Examples

			Irregular triangle begins:
  1;
  2;
  3,4;
  4,5,6,5,6,7,8;
  ...
		

Links

• Sean A. Irvine, Table of n, a(n) for n = 0..10000
• M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic J. Comb. 7 (2000), #R44.

Crossrefs

A008934 gives number of children at level n. Cf. A058223.

Cf. A002083.

Formula

Top node is 1; each node k has children labeled k+1, k+2, ..., 2k at next level.