Yeah, I don't think this breaks any of the rules. We are still using recursion. Just leveraging what the language has to offer.
It is possible to do a form of tail call optimization for the double-recursive algorithm, described here: https://news.ycombinator.com/item?id=18096804
This reduces the number of total function calls but not the number of additions (since it's not changing the algorithm, just the way the function invocation strategy when running the algorithm).