Recurrence Relations I am starting to learn recurrence relations in class and I am having issue with this example:

T(N) = 2N - 1 + T(N-1)

I am bit confused as to get the base case.
I'm sorry if this seems elementary, but I am having a difficult time grasping this concept.

Thank you for your help!
In applications to time complexity of algorithms, you are often only interested bounding the growth (i.e., $O(), \Omega()$ asymptotics), and often the initial values incide as multiplicative factors to the solution (or their influence is swamped by the growth of terms that don't include them). So you'll often see sloppy statements that omit initial values.