login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048829 Number of rooted identity game trees of height <=n, first player to reach to reach top wins. Second player wins. 2
1, 1, 2, 4, 4096 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

Index to divisibility sequences

Index entries for sequences related to rooted trees

FORMULA

a(n) = 2^A048830(n-1). Next term is 2^61440.

CROSSREFS

Cf. A014221, A038081, A048830-A048832.

Sequence in context: A085638 A134718 A328313 * A070655 A006263 A266198

Adjacent sequences:  A048826 A048827 A048828 * A048830 A048831 A048832

KEYWORD

nonn

AUTHOR

Christian G. Bower, Jun 15 1999

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 18:40 EDT 2022. Contains 356016 sequences. (Running on oeis4.)