You're correct that it's 3! There's a couple ways to justify this rigorously. Method (1) below is the most general way that can be used for these types of questions. Method (2) is not as general but is shorter.
Method (1): First we need to show 3 is an upper bound of $A$. This is evident by noticing $\frac 2 n \leq 2$ for all $n$, so $1+\frac 2 n \leq 1 + 2 = 3$ for all $n$, giving us the first condition. The second condition to show is that 3 is the least upper bound, not just any upper bound. Suppose for contradiction there exists a lesser upper bound $s<3$. We need to show there exists an element of $A$ greater than $s$. The element is actually $3$ occurring at $n=1$, so we have a contradiction. In the end, we have that 3 is the least upper bound of $A$, which is exactly the definition of supremum.
Method (2): It can be proven that if a set $S$ has a maximum element, then it is equal to its supremum: $\max S = \sup S$. Here, we have $\max A = 3$ since $3 \in A$ and $3 \geq 1 + \frac 2 n$ for all $n$. Thus, $\sup A = \max A = 3$.