We compute $ B $ using recursion. Let $ a_n $ be the number of $ n $-digit binary-like strings (digits 3 and 4) with no two consecutive 3s. - Sterling Industries