OFFSET
1,1
COMMENTS
It is well known (see Links) that as the hyperexponent of the integer m becomes sufficiently large, the constant convergence speed of m is the number of new stable digits that appear at the end of the result for any further unit increment of the hyperexponent itself, and a sufficient (but not necessary) condition to get this fixed value is to set the hyperexponent equal to m plus 1 (e.g., if n := 3, m = 57 and so 57^^58 has exactly 3 more stable digits at the end of the result than 57^^57).
LINKS
Marco Ripà, On the constant congruence speed of tetration, Notes on Number Theory and Discrete Mathematics, Volume 26, 2020, Number 3, Pages 245—260 (see Table 1, pp. 249—251).
Marco Ripà and Luca Onnis, Number of stable digits of any integer tetration, Notes on Number Theory and Discrete Mathematics, 2022, 28(3), 441—457 (see Equation 16, p. 454).
Wikipedia, Tetration
FORMULA
a(n) is such that A317905(m) = 3, for m = 25, 26, 27, ...
EXAMPLE
If n = 3, m = 57 and so 57^^58 has exactly 3 more stable digits at the end of the result than 57^^57.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Marco Ripà, May 01 2024
STATUS
approved