Recursionhard
0:00.0

Define an=an1+1a_n = \lfloor \sqrt{a_{n-1}} \rfloor + 1 with a0=100a_0 = 100. Find the smallest nn for which an=2a_n = 2.