Design an algorithm which is more efficient than O$($n$)$ that finds the missing element in an array whose elements are generated by the following equation: $3$k $+1,$ k $=0...$n Please use pseudocode.

ex: $\{1,4,7,13,16\}$ should return $10$

Do complexity analysis