I was playing around with the Collatz sequences of numbers up to a number. My question was, for which numbers $n$ does no integer below $n$ reach $n$ in its iteration? So I wrote a program to find all the ones that have that property and I quickly realized all multiples of 3 do. Obviously, because $3n + 1$ can never be a multiple of 3 and if it's not already a multiple of 3, dividing by 2 obviously won't make it one.
However, what I noticed after that is that the rest of the numbers are almost all primes. Only some primes, however, and I'm not sure what the criteria for it is. A small percent of them are also numbers that have some number of prime factors, and as you go up into the higher numbers of course the number of prime factors on average increases. None of these numbers are even for unknown reasons to me that I'm sure I could figure out if I looked hard enough.
Consequently, the percent of these numbers that are prime decreases as you go for higher values of $n$, but remains higher than you'd expect. Of course, there are lots of primes because any number in the list has to be odd, and can't be divisible by 3 because I excluded those because they're trivial.
However, my question is, what, if any, are the criteria for any number that satisfies this property (no integer below $n$ reaches $n$ in its iteration)? Besides not being a multiple of 3 I couldn't come up with any solid reasoning.
As a bonus, is it really true that all numbers even and not divisible by 3 have some number below it whose sequence includes it? And if so, why?