Fibonacci sequence is growing [exponentially](https://en.wikipedia.org/wiki/Fibonacci_number#Relation_to_the_golden_ratio), so yes, for it you don't really want large N

However, of course, there are cases like taking modulo of n-th member of this sequence, but then for alike algorithms you should use your brain, while my recommendation is much more general. In most cases, you indeed don't go over a big sequence.

> Is your background education? If not then it doesn't really matter what your honest opinion is on topic that you have little or none experience in

I'm interacting with people new to programming on daily basis. Most of them are learning loops way before recursion. As well as tutors who teach loops in the beginning.

Note that like I said and like one commenter highlighted, recursion is a tool, and I didn't say in the title that "replace all your loops with recursion". My point is, recursion is way underrated, and there are a lot of cases where it would be better to use recursion.