The sequence (Ln\displaystyle {L}_{{n}}) is generated using the Fibonacci recursion rule
Ln+1=Ln+Ln1\displaystyle {L}_{{{n}+{1}}}={L}_{{n}}+{L}_{{{n}-{1}}}.
However, the initial conditions (the seeds) are different from the Fibonacci sequence. In this case, L0=1\displaystyle {L}_{{0}}={1} and L1=7\displaystyle {L}_{{1}}={7}.

What are the next five values in this sequence?
L2\displaystyle {L}_{{2}} =
L3\displaystyle {L}_{{3}} =
L4\displaystyle {L}_{{4}} =
L5\displaystyle {L}_{{5}} =
L6\displaystyle {L}_{{6}} =