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 A060508 #13 Dec 08 2021 12:07:36
%S A060508 2,1,2,2,2,2,2,2,3,3,3,3,3,3,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,
%T A060508 6,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,10,10,10,10,10,10,10,
%U A060508 10,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13
%N A060508 Exponent of largest power of n < 2^n.
%F A060508 a(n) = floor(n/log(2, n)); n^a(n) <= 2^n <= n^(1+a(n)).
%e A060508 For n = 10, 1000 < 1024 < 10000, so a(10) = 3; a(1) is indeterminate, since 1^j < 2^1.
%t A060508 Table[Floor[n/Log[2, n]],{n,2,89}] (* _Stefano Spezia_, Dec 07 2021 *)
%Y A060508 Cf. A000079, A003992.
%K A060508 easy,nonn
%O A060508 2,1
%A A060508 _Labos Elemer_, Apr 11 2001