login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058222 Tree of tournament sequences read across rows. 4
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; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..80.

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: A257646 A051898 A092032 * A064064 A101504 A125568

Adjacent sequences:  A058219 A058220 A058221 * A058223 A058224 A058225

KEYWORD

nonn,easy,nice,tabf

AUTHOR

N. J. A. Sloane, Dec 02 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 22 20:30 EST 2019. Contains 320404 sequences. (Running on oeis4.)