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 A368131 #72 Jun 02 2025 15:27:31
%S A368131 0,0,1,2,2,3,4,4,5,6,7,7,8,9,9,10,11,12,12,13,14,14,15,16,17,17,18,19,
%T A368131 19,20,21,21,22,23,24,24,25,26,26,27,28,29,29,30,31,31,32,33,34,34,35,
%U A368131 36,36,37,38,39,39,40,41,41,42,43,43,44,45,46,46,47,48
%N A368131 a(n) = floor(n * log(4/3) / log(3/2)).
%C A368131 Highest k with 3^(n+k) <= 4^n * 2^k.
%F A368131 a(n) = floor(n * log(3) / log(3/2)) - 2*n.
%F A368131 a(n) = floor(n * arctanh(1/7) / arctanh(1/5)).
%F A368131 a(n) = A325913(n) - n.
%F A368131 a(n) = A117630(n) - 2*n.
%F A368131 a(n) = A054414(n) - 2*n - 1.
%t A368131 Table[Floor[n*Log[4/3]/Log[3/2]],{n,0,68}] (* _James C. McMahon_, Jan 27 2024 *)
%o A368131 (PARI) alist(N) = my(a=-1, b=1, k=0); vector(N, i, a+=2; b*=3; if(logint(b, 2) < a, a++; b*=3; k++); k); \\ note that i is n+1
%Y A368131 Cf. A054414, A117630, A325913, A369522 (slope).
%K A368131 nonn,easy
%O A368131 0,4
%A A368131 _Ruud H.G. van Tol_, Jan 25 2024