That's the intuition; but the powers are properly defined by recursion from
$$
a^0=1,\quad
a^{n+1}=a\cdot a^n
$$
so $a^0=1$ by definition. It is a sound definition, because it agrees with the property $a^{m+n}=a^m\cdot a^n$ for any natural $m$ and $n$.
Think to what you do when you have a heap of candies to count. You start from zero and take one candy at a time, uttering the corresponding number: one, two, three, and so on.
Similarly, if you have to know how many candies are in a bunch of heaps, you can count each heap and write down the number. Then you start from zero, add the first number, then the second and so on (at this stage you already know how to perform symbolic sums).
For multiplication it's the same, but you start from one! So $a^0=1$, then $a^1=a\cdot 1$, $a^2=a\cdot a^1$, and so on, each time multiplying by $a$ until you arrive at $n$ and you have your $a^n$.