Finding Smallest Integer n Satisfying Perfect Square Condition

Let $$n$$ be a positive integer such that when it is multiplied by 3, and then decreased by 2, the result is a perfect square. In mathematical terms, this can be expressed as:

$$3n - 2 = k^2$$

for some integer $$k$$. What is the smallest positive integer value for $$n$$ that satisfies this equation?