User blog comment:Mh314159/FOX notation/@comment-35470197-20191204015153/@comment-39585023-20191205010043

But what do I do about the problem that f(x) cannot be recursed without replacing the zero? That is, if I have a zero second term and then commence decrementing the first term, what does it mean when I reach f<0,0,c+1>(x)? Should I redefine zero replacement to take effect only when there is a single nonzero final term? Something like f<0,0,c+1>(x) = f(x) where n is a function of x? Or even the simpler f<0,0,c+1>(x) = f(x) and rely on iteration to grow the first two terms? I'm not sure if this would be compatible with all of the other definitions. What do you think? Thank you!