login
Number of identity (asymmetric) trees of width n.
1

%I #10 Dec 19 2015 13:16:47

%S 1,0,0,0,0,1,4,66,65328,2146402440

%N Number of identity (asymmetric) trees of width n.

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

%F a(2n) = 2^(c(n-2))*(2^b(n-1) - b(n-1)-1), a(2n+1) = b(n)*(b(n)-1)/2, b: A038081. c: A014221.

%K nonn

%O 0,7

%A _Christian G. Bower_, Jun 15 1999