cp's OEIS Frontend

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.

A214047 Least m>0 such that n! <= (3/2)^m.

This page as a plain text file.
%I A214047 #6 May 15 2013 05:24:17
%S A214047 1,2,5,8,12,17,22,27,32,38,44,50,56,63,69,76,83,90,98,105,112,120,128,
%T A214047 136,144,152,160,168,176,185,193,202,210,219,228,237,245,254,263,273,
%U A214047 282,291,300,310,319,328,338,347,357,367
%N A214047 Least m>0 such that n! <= (3/2)^m.
%H A214047 Clark Kimberling, <a href="/A214047/b214047.txt">Table of n, a(n) for n = 1..1000</a>
%e A214047 a(6) = 17 because (3/2)^16 < 6! <= (3/2)^17.
%t A214047 Table[m=1; While[n!>(3/2)^m, m++]; m, {n,1,100}]
%t A214047 Join[{1},With[{c=Log[3/2]},Table[Ceiling[Log[n!]/c],{n,2,50}]]] (* _Harvey P. Dale_, May 15 2013 *)
%Y A214047 Cf. A003070, A213857.
%K A214047 nonn,easy
%O A214047 1,2
%A A214047 _Clark Kimberling_, Jul 18 2012