The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A371720 a(n) = m^^m mod 10^len(m), where m = A038399(n) and ^^ indicates tetration or hyper-4. 0
1, 11, 811, 3811, 63811, 763811, 3763811, 5103763811, 515103763811, 19515103763811, 6819515103763811, 8146819515103763811, 3808146819515103763811, 7213808146819515103763811, 9807213808146819515103763811, 4939807213808146819515103763811 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For any n, a(n) == a(n + 1) (mod 10^len(A038399(n))), where len(k) := number of digits in k. Assuming len(a(n)) > 1, this is a general property of every concatenated sequence with fixed rightmost digits (such as A014925, A061839, A092845, and A104759), as shown in Ripà's book "La strana coda della serie n^n^...^n".
Moreover, assuming n > 1, since A038399(n) is congruent to 11 (mod 20), the convergence speed of A038399(n)^^b (say, V(A038399(n), b) = {2, 1, 1, 1, ...}) is 2 at height 1 and becomes a unit value for any integer b > 1 (see Links). Hence, a(n) is given by A038399(n)^^len(A038399(n) - 1) (mod 10^len(A038399(n))), and also by A038399(n)^^len(A038399(n)) (mod 10^len(A038399(n))) since A038399(n)^^len(A038399(n)) == A038399(n)^^len(A038399(n) - 1) (mod 10^len(A038399(n))) holds for any n.
REFERENCES
Marco Ripà, La strana coda della serie n^n^...^n, Trento, UNI Service, Nov 2011, page 60. ISBN 978-88-6178-789-6
LINKS
Marco Ripà, The congruence speed formula, Notes on Number Theory and Discrete Mathematics, 2021, 27(4), 43-61.
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.
Wikipedia, Tetration.
FORMULA
a(n) = A038399(n)^^(len(A038399(n)) - 1) mod 10^len(A038399(n)), where len(A038399(n)) = ceiling(log_10(A038399(n) + 1)).
EXAMPLE
a(8) is given by the rightmost 10 digits of 2113853211^^2113853211 and thus a(8) = 5103763811.
a(9) == a(8) (mod 10^10), i.e., the digits of a(9) end with the digits of a(8) (and then a(9) has 2 more preceding).
CROSSREFS
Cf. A000045 (Fibonacci), A038399, A171882 (tetration), A317824, A317903, A317905.
Sequence in context: A058392 A100369 A196426 * A238715 A162448 A024150
KEYWORD
nonn,base,more
AUTHOR
Marco Ripà, Apr 04 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 1 05:22 EDT 2024. Contains 373010 sequences. (Running on oeis4.)