The sequence is recursively defined by

By this definition,




and so on.
Recall the Fibonacci sequence, {1, 1, 2, 3, 5, 8, 13, 21, …}, where the next term in the sequence is the sum of the previous two terms. If
is the n-th Fibonacci number, then continuing the pattern above we would arrive at

Notice that the sequence of positive powers of 2 leaves a periodic sequence of residues mod 10 :






and so on; the period of this sequence of residues is 4.
The period of
taken mod 4 is 6 :

(This follows from the "properties" section in the link in comment. In this case, π(4) = 3/2 × 4 = 6.)
It follows that

which means the last digit of
is 8.