Suppose $\{a_n\}$ is a sequence. Let $f(n)$ be an increasing function(not strictly) such that $f$ takes each of its values finitely many times, then wouldn't $\{a_{f(n)}\}$ have the same limit as $\{a_n\}$ (assuming $\{a_n\}$ converges)? Then shouldn't $\{a_{f(n)}\}$ be considered a subsequence of $\{a_n\}$?
UPDATE: Edited to clarify what I meant.
The standard definition for subequence requires $f(n)$ to be strictly increasing. See this for example.
If I understand you correctly, you would allow $f$ to be something like
$$f(n) = \begin{cases} 1 & \text{if $1 \le n \le 5$} \\ n & \text{ if } 5 \lt n \end{cases} $$
For this $f$, the sequence $a_{f(n)}$ wouldn't be considered to be a subsequence of $a_n$ per the usual definition; but it is still a sequence, and it does indeed converge to the same limit as $a_n$.
And this of course holds in general; by repeating some of the terms, you are just "delaying" the $N$ after which every term will be within $\epsilon$ of the limit.
I think you probably understand the idea, but just to address your very last sentence: the $a_{f(n)}$ is not considered a subsequence because and only because $f$ is not strictly increasing.