Too clever to be useful, to be honest. One liners are hard to understand, could be expanded a little

this looks awesome

If n<0 and m<0 your code will not see an error, but I understand, that there won't be negative input.

Looks like fixed

learned so much from this. thank you

One must simply cherish your solution soooo much! Enjoyable, elegant, briliant!

So elegant. Congratulations!

I'm in the same boat as you. I knew it could be done, but I just couldn't wrap my head around a recursive solution.

So good. How do I master the recurrrrsssiooonnn. I got as far as writing countArara(n-2) then did it w/o recursion!

so cool

Just wow...I love it

Wow I love this solution!

Can you confirm that now it is fixed?

the42ndGod ReferenceError, you can fix it by setting var the42ndGod = combos;