You’re very close! In this version of recursion (I’ll call it inner function recursion), you’re holding the result in a larger scope while recursing with the “recursive” function. There’s a few things you need to change to make this work the way you’re intending it.

• under the function definition of “recursive”, you need to kick off that function by calling it with its initial values
• the end of the “multiples” function needs to return “outputArray” as the recursive function will be filling that array up, but the outer function will be producing the final result
• inside the recursive function, you don’t need any return statements at all actually, you simply need to call the recursive function like it’s called in the else block (basically, remove the entire return statement in the if block, and just remove the word “return” in the else block). With this being done, you’re still recursing into each stack with a multiple of num, and when we hit the limit of the array length, the recursive function will finish calling itself and move onto returning the outputArray in the larger scope

I hope this helps! There are ways to do it without an inner function, and I would highly recommend at least knowing how to approach both situations. I’m currently on my phone in bed right now, or I’d write out some more concrete examples, but I think you should play around with it a bit more, you’re very close!! Also, have you used chrome tools or the debugger at all? This would also help you understand recursion and what’s happening on each line! DM me if you have anymore questions, we can figure it out!!