Let T$($n$)$ be the number of $($rooted$)$ binary tree configurations with exactly n nodes. Examples

of the first few values of T are shown below $$ two trees are distinct if a single node changes

position, with right and left children considered distinguishable.