Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jan 02 2022 18:41:08
%S 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 56,59,62,65,68,72,75,78,81,84,88,91,94,98,101,104,108,111,115,118,
%U 122,125,129,132,136,139,143,146,150,154,157,161,165,168,172,176
%N Least m such that n! <= 3^m.
%C Also the number of digits in the ternary representation of n!. - _Martin Renner_, Jan 03 2022
%H Clark Kimberling, <a href="/A213857/b213857.txt">Table of n, a(n) for n = 1..1000</a>
%e a(8) = 10 because 3^9 < 8! <= 3^10.
%p seq(nops(convert(n!,base,3)),n=1..100); # _Martin Renner_, Jan 03 2022
%t Table[m=1; While[n!>3^m, m++]; m, {n,1,100}]
%Y Cf. A003070, A072831, A213854.
%K nonn,easy
%O 1,3
%A _Clark Kimberling_, Jul 17 2012