Let the given statement be P(n), i.e.
P(n):1+11+2+11+2+3+.....+11+2+3+....n=2nn+1
For n=1, we have
P(1):1=2.11+1=22=1, which is true.
Let P(k) be true for some positive integer k i.e,
1+11+2+....+11+2+3+...+11+2+3+....+k=2kk+1 ..........(i)
We shall now prove that P(k+1) is true.
Consider
1+11+2+11+2+3+....+11+2+3+....+k+11+2+3+....+k+(k+1)
=(1+11+2+11+2+3+....+11+2+3+....k)+11+2+3+....+k+(k+1)
=2kk+1+11+2+3+...+k+(k+1) [ Using (i)]
=2kk+1+1((k+1)(k+1+1)2) [1+2+3+....+n=n(n+1)2]
=2k(k+1)+2(k+1)(k+2)
=2(k+1)(k+1k+2)
=2(k+1)(k2+2k+1k+2)
=2(k+1)[(k+1)2k+2]
=2(k+1)(k+2)
Thus, P(k+1) is true whenever P(k) is true.
Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e. N.