Ononot — Let an be the number of paths of length n starting at the ro

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionmedium

0:00.0

Let $a_n$ be the number of paths of length $n$ starting at the root of a full binary tree and moving only downwards. What is the value of $a_5$ ?