I have a problem, for which the solution(by looking at the pattern) I found is
$$f(n)=\begin{cases}2n-3,\text{if }n<4\\2n-4,\text{if }n\ge 4\;.\end{cases}$$
I want to prove it inductively, I'm confused as to where do I begin? I know the basic induction proving it for $n=1$, assuming it true for $n=1,\dots,n-1$, and then proving it for $n=n$.
The problem is here $f(n)$ for $n=1$ is different and for $n-1$ (if greater than $3$ it will be different). If someone can guide me... how do I go on proving this thing.
Update: I have heard that induction works because we prove it for n=1, assume it true for n=1... n-1 and then prove it for n=n... which works because proving it for n=n is similar to n=1 and it again proves for n=(n+1)... (2n-1), we keep on going like that.