A good induction argument should take you from the base case, as far as you want to go. You need to establish the $8$ cent case, and a rule that shows how to take the $k$ cent case, and produce the $k + 1$ cent case. You're missing the $8$ cent case, but that's easy: $8 = 3 + 5$.
Now, we should be able to apply your rule to make every subsequent number of cents. Your rule is as follows:
$$3x + 5y = k \implies 3(x + 2) + 5(y - 1) = k + 1.$$
Here's a question: how do you know that $y - 1$ is a sensible number of $5$ cent coins? To see this, let's try applying this rule to $8$ cents in order to get $9$ cents:
$$3 \cdot 1 + 5 \cdot 1 = 8 \implies 3 \cdot 3 + 5 \cdot 0 = 9.$$
This works out; three $3$ cent coins will make $9$ cents. Let's try again for $10$ cents:
$$3 \cdot 3 + 5 \cdot 0 = 9 \implies 5 \cdot 3 + 5 \cdot (-1) = 10.$$
Arithmetically, this is true, but we can't allow negative one $5$ cent coins! The combination $3(x + 1) + 5(y - 1)$ works fine, provided $y > 0$, but you haven't dealt with the $y = 0$ case!
Instead, I suggest first manually dealing with $8$, $9$, and $10$ individually. We have ways of making $8$ and $9$ already. To make $10$, we have
$$10 = 0 \cdot 3 + 2 \cdot 5.$$
Then, $11$ is just $8$ with $3$ more cents added on, $12$ is $9$ with another $3$ cents, similarly $13$ is $10$ with another $3$ cents, etc. If you do strong induction, and assume for a given $n$, $k$ cents can be made for every $8 \le k < n$, then appeal to $n - 3$, and add another $3$ cent coin to the collection. That is, provided $n > 10$; otherwise refer back to the three explicit cases.