|
| |
|
|
A373387
|
|
Constant congruence speed of the tetration base n (in radix-10) and -1 if n is a multiple of 10.
|
|
1
|
|
|
|
0, 0, 1, 1, 1, 2, 1, 2, 1, 1, -1, 1, 1, 1, 1, 4, 1, 1, 2, 1, -1, 1, 1, 1, 2, 3, 2, 1, 1, 1, -1, 1, 2, 1, 1, 2, 1, 1, 1, 1, -1, 1, 1, 2, 1, 2, 1, 1, 1, 2, -1, 2, 1, 1, 1, 3, 1, 3, 1, 1, -1, 1, 1, 1, 1, 6, 1, 1, 3, 1, -1, 1, 1, 1, 2, 2, 2, 1, 1, 1, -1, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,6
|
|
|
COMMENTS
|
It has been proved that this sequence contains arbitrarily large entries, while a(0) = a(1) = 0 by definition (given the fact that 0^0 = 1 is a reasonable choice and then 0^^b is 1 if b is even, whereas 0^^b is 0 if b is even). For any nonnegative integer n which is not a multiple of 10, a(n) is given by Equation (16) of the paper "Number of stable digits of any integer tetration" (see Links).
Moreover, a sufficient condition for having a constant congruence speed of any tetration base n, greater than 1 and not a multiple of 10, is that b >= 2 + v(n), where v(n) is equal to
u_5(n - 1) iff n == 1 (mod 5),
u_5(n^2 + 1) iff n == 2,3 (mod 5),
u_5(n + 1) iff n == 4 (mod 5),
u_2(n^2 - 1) - 1 iff n == 5 (mod 10)
(u_5 and u_2 indicate the 5-adic and the 2-adic valuation of the argument, respectively).
Therefore b >= n + 1 is always a sufficient condition for the constancy of the congruence speed (as long as n > 1 and n <> 0 (mod 10)).
As a trivial application of this property, we note that the constant congruence speed of the tetration 3^^b is 1 for any b > 1, while 3^3 is not congruent to 3 modulo 10. Thus, we can easily calculate the exact number of the rightmost digits of Graham’s number, G(64) (see A133613), that are the same of the homologous rightmost digits of 3^3^3^... since 3^3 is not congruent to 3 modulo 10, while the congruence speed of n = 3 is constant from height 2 (see A372490). This means that the last slog_3(G(64))-1 digits of G(64) are the same slog_3(G(64))-1 final digits of 3^3^3^..., whereas the difference between the slog_3(G(64))-th digit of G(64) and the slog_3(G(64))-th digit of 3^3^3^... is congruent to 6 modulo 10.
|
|
|
REFERENCES
|
Marco Ripà, La strana coda della serie n^n^...^n, Trento, UNI Service, Nov 2011. ISBN 978-88-6178-789-6.
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = -1 iff n == 0 (mod 10), a(n) = 0 iff n = 1 or 2. Otherwise, a(n) >= 1 and it is given by Equation (16) from Ripà and Onnis.
|
|
|
EXAMPLE
|
a(3) = 1 since 3^^b := 3^3^3^... freezes 1 more rightmost digit for each unit increment of b, starting from b = 2.
|
|
|
CROSSREFS
|
Cf. A067251, A133613, A317824, A317903, A317905, A349425, A370211, A370775, A371129, A371671, A372490.
Cf. A000007, A018247, A018248, A063006, A091661, A091663, A091664, A120817, A120818, A290372, A290373, A290374, A290375.
|
|
|
KEYWORD
|
sign,base,changed
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
