|
%I #13 Dec 19 2015 13:16:28
%S 1,1,2,4,4096
%N Number of rooted identity game trees of height <=n, first player to reach to reach top wins. Second player wins.
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F a(n) = 2^A048830(n-1). Next term is 2^61440.
%Y Cf. A014221, A038081, A048830-A048832.
%K nonn
%O 0,3
%A _Christian G. Bower_, Jun 15 1999
| 