Bases for which Tetration is well-defined

[andydude]

To clarify even more, I think that the domain over which the super-logarithm coefficients are solvable is much bigger, specifically \( |b|>1 \), but since for many of these bases, the coefficients failed to converge, I had to put more thought into exactly where they converge. That is how I found the root-test above.

Andrew Robbins