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.

A213851 Least m such that m!*2^m >= n!

This page as a plain text file.
%I A213851 #9 Jul 20 2012 04:06:28
%S A213851 1,1,2,3,4,5,6,6,7,8,9,10,11,12,12,13,14,15,16,17,18,18,19,20,21,22,
%T A213851 23,24,24,25,26,27,28,29,30,31,31,32,33,34,35,36,37,38,38,39,40,41,42,
%U A213851 43,44,45,46,46,47,48,49,50,51,52,53,53,54
%N A213851 Least m such that m!*2^m >= n!
%H A213851 Clark Kimberling, <a href="/A213851/b213851.txt">Table of n, a(n) for n = 1..1000</a>
%e A213851 a(8) = 6 because (2^5)*5! < 8! <= (2^6)*6!.
%t A213851 Table[m=1; While[n!>(2^m)*m!, m++]; m, {n,1,100}]
%Y A213851 Cf. A094331.
%K A213851 nonn,easy
%O A213851 1,3
%A A213851 _Clark Kimberling_, Jul 17 2012