MauiMano, you might read through some of the other forums; here’s a sample thread: viewtopic.php?f=137&t=3200
If it helps, you might think of recursion like a storyteller who likes to take tangents.
Imagine that the story starts out describing two buddies out hunting when one of them trips over a piece of trash, and that incident sends the storyteller into a story about the clumsiest dog he ever knew, which turns into a story about watching To Kill a Mockingbird as a kid.
Now, after the last story wraps up, the storyteller returns to the clumsy dog, and when he’s done with the dog, we find ourselves back in the woods with the hunting buddies. (Anyone who has listened to enough Garrison Keillor should be familiar with the “Oh yeah, that’s where we started this story” revelation.)
That process of stepping deeper and deeper into a sequence of stories, and then unwinding the stories in reverse order, is very much akin to recursion. Each function call is suspended while the next executes, but eventually the earlier ones have to be finished.
(The “0 to N” comment by ibex10 is just a way of describing an arbitrary set of numbers starting at 0.)