[go: up one dir, main page]

login
A058222
Tree of tournament sequences read across rows.
5
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,2
LINKS
M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic J. Comb. 7 (2000), #R44.
FORMULA
Top node is 1; each node k has children labeled k+1, k+2, ..., 2k at next level.
EXAMPLE
Irregular triangle begins:
1;
2;
3,4;
4,5,6,5,6,7,8;
...
CROSSREFS
A008934 gives number of children at level n. Cf. A058223.
Cf. A002083.
Sequence in context: A257646 A051898 A092032 * A064064 A101504 A125568
KEYWORD
nonn,easy,nice,tabf
AUTHOR
N. J. A. Sloane, Dec 02 2000
STATUS
approved