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 A095703 #19 Jun 20 2021 02:46:32
%S A095703 1,2,3,4,5,6,7,7,8,9,10,10,11,12,12,13,13,14,15,15,16,17,17,18,18,19,
%T A095703 19,20,21,21,22,22,23,23,24,25,25,26,26,27,27,28,28,29,29,30,30,31,31,
%U A095703 32,32,33,33,34,34,35,35,36,36,37,37,38,38,39,39,40,40,41,41
%N A095703 Integer part of the (positive) solution to x^x = 10^n.
%H A095703 Alois P. Heinz, <a href="/A095703/b095703.txt">Table of n, a(n) for n = 0..10000</a> (first 1001 terms from Andrew Howroyd)
%F A095703 a(n) = n*log(10)/LambertW(n*log(10)) for n > 0, a(0) = 1. - _Alois P. Heinz_, Nov 07 2019
%p A095703 a:= n-> `if`(n=0, 1, (t-> floor(t/LambertW(t)))(n*log(10))):
%p A095703 seq(a(n), n=0..80); # _Alois P. Heinz_, Nov 07 2019
%o A095703 (PARI) a(n) = floor(solve(x=1, max(10,n+1), x^x-10^n))
%o A095703 (PARI) a(n) = {my(k=1); while(k^k <= 10^n, k++); k-1} \\ _Andrew Howroyd_, Nov 07 2019
%Y A095703 Cf. A066022, A086858.
%K A095703 easy,nonn
%O A095703 0,2
%A A095703 _Cino Hilliard_, Jul 06 2004
%E A095703 Terms a(23) and beyond from _Andrew Howroyd_, Nov 07 2019