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.

Sun, 03 May 2026 18:45:11 +0000

Content under review