fast accurate Kneser sexp algorithm

[nuninho1980]

This is an update to support an sexp(z) mapping for bases<eta. The program starts with the regular entire superfunction developed from the repelling fixed point, and calculates \( \text{sexp}(z)=\text{RegularSuperf}(z+\theta(z)) \), where \( \theta(z) \) decays to zero as imag(z) goes to +I*infinity. Thus the solution for bases<eta differs from the standard solution, developed from the attracting fixed point. See this post for discussion, and graphs.

This version will converge for converge for 1.449<=B<=1000000, and 1<bases<1.444. This program is very very slow for bases close to but greater than eta; in those cases, I recommend using "\p 28" for less accurate, but faster results (using 5 iterations).
-Sheldon

I can calculate good for base 1.1.
I tried bases 1.01 and 1.001 but I get not big precision and too small precision, respectively.

but good -> http://math.eretrandre.org/tetrationforu...hp?tid=272 - other 1 code for mathematica.