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 A370255 #48 Feb 21 2024 03:04:18 %S A370255 1,1,1048576,205891132094649,1208925819614629174706176, %T A370255 88817841970012523233890533447265625, %U A370255 48873677980689257489322752273774603865660850176,143503601609868434285603076356671071740077383739246066639249 %N A370255 (n*10)^(n*10) omitting its rightmost trailing 0's. %H A370255 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. %F A370255 a(n) = A004151((n*10)^(n*10)). %F A370255 a(n) = A004151(n)^(n*10), for n >= 1. %e A370255 a(0) = A004151(0^0) = A004151(1) = 1. %e A370255 a(2) = 1048576 since 20^20 = 104857600000000000000000000. %o A370255 (Python) %o A370255 def A370255(n): %o A370255 if n == 0: return 1 %o A370255 m = n %o A370255 a, b = divmod(m,10) %o A370255 while not b: %o A370255 m = a %o A370255 a, b = divmod(m,10) %o A370255 return m**(10*n) # _Chai Wah Wu_, Feb 20 2024 %Y A370255 Cf. A000312, A002489, A004151, A008592, A369771, A369826. %K A370255 nonn,easy,base %O A370255 0,3 %A A370255 _Marco Ripà_, Feb 13 2024