This solution isn't as elegant as could be... Anyway.
We have a recurrence relation
with initial condition
.
This recurrence is inhomogeneous (because of the
), but we can try homogenising it with a substitution
, where
is a constant.
We want the sequence
to satisfy
.
Now we have
.
Solving our recurrence relation
with initial condition
, we obtain
using characteristic equations and what-not (which I believe is quite standard in Olympiad Mathematics?).
Hence
, which is consistent with Alvin's post above.
(Alvin has
.)
Now, from your progress on the problem, you observed that the sequence
seems to satisfy
with
.
If we define
to actually be the recurrence satisfying
with
, then solving the recurrence relation gives
.
Now the only thing left to do is to cross our fingers and hope we can prove that
.
And finally,
, so, indeed
.
The only other thing to prove is that
is actually an integer, which is easy, given that we defined it as the sequence
with
.