Induction · Challenge problem

Tower of Hanoi with a restriction: three pegs in a row, and a disk may only move between ADJACENT pegs. Moving $n$ disks from the left peg to the right peg satisfies $T(n) = 3T(n - 1) + 2$, $T(1) = 2$. How many moves does it take for $6$ disks?