|
Search: id:A058222
|
|
|
| A058222 |
|
Tree of tournament sequences read across rows. |
|
+0
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
(list; graph; listen)
|
|
|
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
|
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: A049987 A051898 A092032 this_sequence A064064 A101504 A125568
Adjacent sequences: A058219 A058220 A058221 this_sequence A058223 A058224 A058225
|
|
KEYWORD
|
nonn,easy,nice,tabf
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2000
|
|
|
Search completed in 0.002 seconds
|
