This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A369624 #34 Feb 16 2025 08:34:06 %S A369624 0,1,6,87,96,8203125,8656,2343,56,289,0,6611,16,53,36,765380859375, %T A369624 5616,777,76,179,0,2421,6,47,4976,908447265625,84203776,83,96,669,0, %U A369624 6431,4176,713,16,8046875,7136,917,6,759,0,7641,6,1107,56,48828125,9696,23,36 %N A369624 Numbers formed by the rightmost decimal digits of n^(n^n) that are the same as those of n^(n^(n^n)). %C A369624 The common digits might include leading 0's (such as at n = 5) and they are discarded (in particular, a(0) = 0 indicates that the corresponding zero digit term results in a 0 integer entry). %C A369624 a(k*10) = 0 for every positive integer k, since (k*10)^((k*10)^(k*10)) and (k*10)^((k*10)^((k*10)^(k*10))) have in common only their rightmost (k*10)^(k*10) digits. %H A369624 Jorge Jiménez Urroz and José Luis Andrés Yebra, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Yebra/yebra4.html">On the Equation a^x == x (mod b^n)</a>, Journal of Integer Sequences, Article 09.8.8, 2009. %H A369624 Marco Ripà, <a href="https://arxiv.org/abs/2402.07929">Congruence speed of tetration bases ending with 0</a>, arXiv:2402.07929 [math.NT], 2024. %H A369624 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/JoyceSequence.html">Joyce Sequence</a>. %H A369624 Wikipedia, <a href="http://en.wikipedia.org/wiki/Knuth's_up-arrow_notation">Knuth's up-arrow notation</a>. %F A369624 a(n) = A002488(n) (mod 10^k), where k is such that n^(n^n) == n^(n^(n^n)) (mod 10^k) and n^(n^n) <> n^(n^(n^n)) (mod 10^(k+1)). %e A369624 For n = 3, 3^(3^3) = 7625597484987 and 3^(3^(3^3)) == 387 (mod 1000) so there are two common final digits a(3) = 87. %Y A369624 Cf. A002488, A317824, A317903, A317905, A349425. %K A369624 sign,base %O A369624 0,3 %A A369624 _Marco Ripà_, Jan 27 2024