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

My modem shut off when I was posting this:

"Should I redefine zero replacement to take effect only when there is a single zero first or multiple first terms?  Something like f<0,0,c+1>(x) = f(x) where n is a function of x, for any number of leading zeroes?  Or even the simpler f<0,0,c+1>(x) = f(x) and rely on iteration to grow the initial terms?"

I think it is similar to what you posted? Except you have f<0,0,c+1>(x) = f<0,x,c>(x). What about iterating? Could I use f<0,0,c+1>(x) = fp(x) and get faster growth for sufficiently large p?

Should I be disappointed that all I have done with my notation is do almost exactly what the FGH already does? The subscript is a minor change? I thought it contributed a lot to the growth. Would it be more powerful if I combined it with iteration, like f<(a,b,c)>(x) = f<(a-1,b,c)>xp(x) ?

I kind of feel a little disappointed that all I have done is rephrase the FGH.