login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,3
FORMULA
a(n) = 2^A048830(n-1). Next term is 2^61440.
CROSSREFS
KEYWORD
nonn
AUTHOR
Christian G. Bower, Jun 15 1999
STATUS
approved