Number of binary trees of height n such that the number of nodes at depth d equals d+1 for every d = 0..n.
A338550
Number of binary trees of height n such that the number of nodes at depth d equals d+1 for every d = 0..n.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =60a(4) =3360a(5) =705600a(6) =558835200
External references
- oeis: A338550