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 A343945 #15 Sep 08 2022 08:46:26
%S A343945 1,1,2,1,2,1,3,1,2,2,3,1,3,2,2,2,4,2,4,2,2,2,4,1,3,2,2,2,4,2,5,2,2,2,
%T A343945 2,2,5,2,2,2,5,2,5,2,2,3,5,2,3,2,3,2,5,2,3,2,3,3,5,2,5,3,2,2,3,2,6,2,
%U A343945 3,2,6,2,6,3,2,2,3,2,6,2,2,3,6,2,3,3,3
%N A343945 a(1) = 1; for n >= 2, a(n) = floor(log(sigma(n)) / log(tau(n))).
%C A343945 See A051281 for numbers m such that sigma(m) = tau(m)^k where k = integer, i.e., numbers m such that floor(log(sigma(m)) / log(tau(m))) = log(sigma(m)) / log(tau(m)).
%e A343945 a(6) = floor(log(sigma(6)) / log(tau(6))) = floor(log(12) / log(4)) = floor(1.792481...) = 1.
%e A343945 a(7) = floor(log(sigma(7)) / log(tau(7))) = floor(log(8) / log(2)) = floor(3) = 3.
%t A343945 a[1] = 1; a[n_] := Floor[Log @@ DivisorSigma[{0, 1}, n]]; Array[a, 100] (* _Amiram Eldar_, Dec 16 2021 *)
%o A343945 (Magma) [1] cat [Floor(Log(&+Divisors(n)) / Log(#Divisors(n))): n in [2..100]]
%Y A343945 Cf. A000005(tau), A000203(sigma), A051281, A334455, A349006, A349007.
%K A343945 nonn
%O A343945 1,3
%A A343945 _Jaroslav Krizek_, Dec 16 2021