$T_1 = 1$ (2)

Related Articles

• $U_n = T_{n-1}$ (append 2 to a string ending in exactly one 2)
• Initial conditions ($n=1$):
• $S_1 = 1$ (string: 3)
• $U_1 = 0$ (can’t have two 2s)
• Now compute step by step:
• $n=2$:

Trending Articles

Is Your LOTR Online Account Secretly Epic? Find Out NowThe ONE Trick to Securing Your LOTR Online Account ForeverMax and Game: Can You Survive the Night?Max and Game: The Impossible Choice You'll FaceMax and Game: Why Everyone Is Talking About ThisPlay Now: The Addictive Online Game with Unlimited HairstylesThis Game Makes You a Hair Stylist—No Downloads Needed!Transform Your Avatar in This Viral Free Hair Salon Game!Guess the Celebrity Hairstyle in This Free Challenge GameUnbelievable Snake vs Block Gameplay You Have to See to Believe