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 A365707 #23 Apr 13 2025 07:11:21
%S A365707 0,1,8,8,1,1,2,5,1,3,1,3,1,3,1,6,2,1,7,3,2,1,7,4,3,2,1,1,9,7,6,5,4,4,
%T A365707 3,3,3,3,4,4,4,5,6,7,9,1,1,1,2,3,4,6,8,1,1,2,4,6,1,1,2,4,8,1,2,4,8,1,
%U A365707 2,5,1,1,3,7,1,3,6,1,2,6,1,3,7,1,3,8,2
%N A365707 Initial digit of n^(n+1) (A007778(n)).
%H A365707 Robert Israel, <a href="/A365707/b365707.txt">Table of n, a(n) for n = 0..10000</a>
%F A365707 a(n) = floor((n^(n+1))/10^floor(log_10(n^(n+1)))).
%F A365707 a(n) = A000030(A007778(n)).
%e A365707 a(3) = 8, since 3^(3+1) = 3^4 = 81.
%p A365707 seq(convert(n^(n+1),base,10)[-1],n=0..100); # _Robert Israel_, Feb 16 2024
%t A365707 Join[{0}, Table[Floor[n^(n+1)/10^Floor[Log10[n^(n+1)]]], {n, 86}]]
%Y A365707 Cf. A000030, A007778, A061505, A138029, A364855, A365935.
%K A365707 nonn,base
%O A365707 0,3
%A A365707 _Marco Ripà_, Sep 16 2023