Using the pumping lemma show that the following language is not regular:

{a^n^2 |n 1} = {a, aaaa, aaaaaaaaa, aaaaaaaaaaaaaaaa, . . .}