Lucky Integers

Given an array **A** of size $n$ filled with elements from [Recamán's sequence](https://en.wikipedia.org/wiki/Recam%C3%A1n%27s_sequence) ; $a_0$ to$a_{n-1}$. Lets define a variable $res$. - Pick any 2 elements from the array, $a_i$ ($0 \leq i \leq n-1$) and $a_j$ ($i-k \leq j \leq i+k$ , provided it exists) such that $a_i ≠ a_j$ and store the product of $a_i$ and $a_j$ into $res$. - Add any