$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 Louisville Estate Plan Secretly Broken?Huntington Beach Injury Lawyers: What Secrets Do They Hide?Will Loeffler Law Group PLC Solve Your Case?Is Anthony DeLuca Judge Really Pulling the Strings Behind the Scenes?Kenneth Wallace: The Untold Story Behind The Courtroom LegendTeresa Davis North Carolina: The Lawyer Shaking Up the System?I Tried the Top Hauppauge Domestic Violence Lawyer—Here’s What HappenedWhat Secrets Does Loeffler Law Group PLC Know?San Antonio Arson Lawyer: The One Call That Changes EverythingWhat Secrets Do Lakewood Personal Injury Lawyers Know That You Don't?