Well now if the 11 were a 13 it would be easy since I am a little familiar with the Fibonacci sequence. But, since it isn't exactly that I'll guess '4 numbers of the Fibonacci sequence, then subtract 2 from the the next and repeat starting with the next in sequence' so we have
Nn = Fn+2; n = 5 m + j, j = 1, 2, 3, 4
N5m+5 = F5m+7 - 2; m = 0, 1, 2, 3, ...
where Fn is the nth Fibonacci number.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.