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 A213857 #8 Jan 02 2022 18:41:08
%S A213857 1,1,2,3,5,6,8,10,12,14,16,19,21,23,26,28,31,34,36,39,42,45,47,50,53,
%T A213857 56,59,62,65,68,72,75,78,81,84,88,91,94,98,101,104,108,111,115,118,
%U A213857 122,125,129,132,136,139,143,146,150,154,157,161,165,168,172,176
%N A213857 Least m such that n! <= 3^m.
%C A213857 Also the number of digits in the ternary representation of n!. - _Martin Renner_, Jan 03 2022
%H A213857 Clark Kimberling, <a href="/A213857/b213857.txt">Table of n, a(n) for n = 1..1000</a>
%e A213857 a(8) = 10 because 3^9 < 8! <= 3^10.
%p A213857 seq(nops(convert(n!,base,3)),n=1..100); # _Martin Renner_, Jan 03 2022
%t A213857 Table[m=1; While[n!>3^m, m++]; m, {n,1,100}]
%Y A213857 Cf. A003070, A072831, A213854.
%K A213857 nonn,easy
%O A213857 1,3
%A A213857 _Clark Kimberling_, Jul 17 2012