MathCastle
Proof WritingHardInduction

Induction · Hard problem

Define a1=1a_1 = 1 and, for n≥2n \ge 2, an=a1+a2+⋯+an−1+1a_n = a_1 + a_2 + \cdots + a_{n-1} + 1. Strong induction proves a closed form. What is a15a_{15}?