Let f$($n$)$f$($n$)$ be the minimal number of steps to solve the Tower of Hanoi$$game with nn disks. f$($n$)$f$($n$)$ can be defined recursively as follows:

The basis step: f$(1)=1$f$(1)=1$

The recursive step: f$($n$)=2$f$($n$1)+1$f$($n$)=2$f$($n$1)+1,$ when n$>1$