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 A022927 #10 Mar 01 2024 06:21:08
%S A022927 1,1,2,1,2,1,2,1,2,1,2,1,2,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,1,2,1,2,1,
%T A022927 2,1,2,1,2,1,2,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,1,2,1,2,1,2,1,2,1,2,1,
%U A022927 2,1,2,1,1,2,1,2,1,2,1,2,1,2,1,2,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2
%N A022927 Number of integers m such that 5^n < 3^m < 5^(n+1).
%H A022927 Amiram Eldar, <a href="/A022927/b022927.txt">Table of n, a(n) for n = 0..10000</a>
%F A022927 Asymptotic mean: lim_{m->oo} (1/m) * Sum_{k=1..m} a(k) = log_3(5) (A113209). - _Amiram Eldar_, Mar 01 2024
%e A022927 From _Amiram Eldar_, Mar 01 2024: (Start)
%e A022927 a(0) = 1 because 5^0 = 1 < 3^1 = 3 < 5^1 = 5.
%e A022927 a(1) = 1 because 5^1 = 5 < 3^2 = 9 < 5^2 = 25.
%e A022927 a(2) = 2 because 5^2 = 25 < 3^3 = 27 < 3^4 = 81 < 5^3 = 125. (End)
%t A022927 Join[{1}, Differences@ Table[Floor[n * Log[3, 5]], {n, 1, 100}]] (* _Amiram Eldar_, Mar 01 2024 *)
%Y A022927 Cf. A022922, A113209.
%K A022927 nonn,easy
%O A022927 0,3
%A A022927 _Clark Kimberling_