I have to find the number of subsets within the set 1, 2, 3, ....n
that contain no two consecutive integers, where 0 and n also count as consecutive.
I have tried this proof where 0 and n do not count as consecutive, and I know it roughly follows the Fibonacci sequence, but it is the 0 and n part that is confusing me. Does this mean that the empty set and n are consecutive? And therefore the set containing just n is consecutive? I have seen questions like this where 1 and n count as consecutive, but the fact that I am asked to do this with 0 and n is confusing to me.
The more detail in explaining your answer the better. Thank you.