[Eclipse]

I know this isn't exactly the smallest, and is quite large compared to some other entries, but I am entering since this is sort of a unique entry. I used the Wolfram language, which breaks off from both the Python and NodeJS entries.

Also 69 byte master race!

Code:

n=10;While[1!=n,Print[n];n=Part[{n/2,(n*3)+1},Mod[n,2]+1]]; Print[n];

It should still be considered, just a penalty applied. (Such as +10 bytes to score).

Go fast Haskell))) https://www.haskell.org/

I agree with Lux, but your program isn't as small as Shebang's so you wouldn't win anyway, and I'd hate to add points to 69, so I'll accept your solution as-is.