Let f be a Fibonacci-like sequence seeded by f(1)=1, f(2)=k. a(n) is the smallest k > 0 such that f(n) is a square, or 0 if no such k exists.

A236534

Let f be a Fibonacci-like sequence seeded by f(1)=1, f(2)=k. a(n) is the smallest k > 0 such that f(n) is a square, or 0 if no such k exists.