Consider the infinite sequences
$$A=\left\{\begin{array}{lcr} 1,\\2,2,\\3,3,3,\\4,4,4,4,\\\vdots\end{array}\right\}\qquad B=\left\{\begin{array}{lcr} 1,\\2,3,\\3,4,5,\\4,5,6,7,\\\vdots\end{array}\right\} \qquad C=\left\{\begin{array}{lcr} 1,\\2,1,\\3,2,1,\\4,3,2,1,\\\vdots\end{array}\right\}$$
$A$ is constructed by adding $n$ copies of $n$.
$B$ is constructed by counting up from $n$ to $2n-1$.
$C$ is constructed by counting down from $n$ to $1$.
It's immediately clear that all three sequences have the same number of elements, namely infinitely many. However, if you ask how many times some $x$ appears in a sequence, you get different results: $x$ for $A$, $\left\lceil{x/2}\right\rceil$ for $B$, and infinitely many for $C$.
In one sense, I understand why this is; it's pretty clear from inspection that $C$'s elements will show up in each consecutive row, while the other two sequences' elements fizzle out.
What I'm curious about is if there's a more satisfying explanation for what's happening here, or a rule that covers this behavior. Based on only a description to the effect of "$A$ stays constant, $B$ counts up, $C$ counts down," I would never expect one of them to have such wildly different properties from the other two.