There are $n$ lamps in a row. Some of which are on. Every minute all the lamps already on go off. Those which were off and were adjacent to exactly one lamp which was on will go on. For which $n$ one can find an initial configuration of lamps which were on, such that at least one lamp will be on at any time?
$n=1$ and $n=3$ are not solutions.
Here is a construction for $n\ne 1,3$:
-For $n=2$: $01$
-For $n=4k$: $01100110...0110$ ($k$ groups of $0110$)
-For $n=4k+1$: $01100110...011001010$ ($k-1$ groups of $0110$ and $01010$ at the end)
-For $n=4k+2$: $01100110...011001$ ($k$ groups of $0110$ and $01$ at the end)
-For $n=4k+3$: $01100110...0110001$ ($k$ groups of $0110$ and $001$ at the end)
(I write $0$ for a lamp which is on and $1$ for a lamp which is off)