Simplifying/re-expressing a generating function for an integer sequence using Mathematica

Question

Consider the sequence of natural numbers generated by:

$f(n) = 2 n + (-1)^n/2 - 1/2$,

for $n > 0$ and $n \in \mathbb{Z}^+$ (positive integers):

i.e., {1, 4, 5, 8, 9, 12, 13, 16, 17, 20, ...}

Inspired by this mathematics question, how would one use FunctionExpand, Simplify, FullSimplify, FindSequenceFunction, various substitution rules, and other Mathematica functions to derive (not confirm) that

$$f(n) = \left\lfloor {4 \over 3} \left\lfloor {3 n \over 2} \right\rfloor \right\rfloor ,$$

where of course $\lfloor x \rfloor$ or Floor[x] (read "floor of $x$") is the greatest integer less than or equal to $x$, or that

$$f(n) = 2n - (n\!\!\!\!\!\!\mod2)?$$

Answer 1

If an over-complicated solution suffice...

f[n_] := Floor[4/3*Floor[3/2*n]]
Table[{k, Simplify[f[3*2*m + k], m \[Element] Integers] /. 
    m -> (n - Mod[n, 3*2])/6}, {k, 0, 5}];

Where the second line we are just changing m=3*2*m + k, with k a number between 0 and 5.

FullSimplify[InterpolatingPolynomial[%, Mod[n, 3*2]], n \[Element] Integers]

Next, we interpolate the result in k, which is basically Mod[n, 3*2] and simplify.

We arrive at this beauty:

2 n - 1/15 (Mod[n, 6] - 4) (Mod[n, 6] - 2) Mod[n, 6] (Mod[n, 6] (2 Mod[n, 6] - 13) + 16)

Which can be numerically tested, and it gives the same result as the original f[n].

My approach (lame) works with any function of this kind and the end result is absurdly complex.

BTW, this function remembers me Collatz...