%I A003070 M2407
%S A003070 0,1,3,5,7,10,13,16,19,22,26,29,33,37,41,45,49,53,57,62,66,70,75,
%T A003070 80,84,89,94,98,103,108,113,118,123,128,133,139,144,149,154,160,
%U A003070 165,170,176,181,187,192,198,203,209,215,220,226,232,238,243,249
%N A003070 Ceiling (log_2 n!).
%D A003070 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003070 D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.3.1.
%D A003070 E. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms, Prentice-Hall, 
               1977, section 7.4.
%D A003070 Tianxing Tao, On optimal arrangement of 12 points, pp. 229-234 in Combinatorics, 
               Computing and Complexity, ed. D. Du and G. Hu, Kluwer, 1989.
%H A003070 <a href="Sindx_So.html#sorting">Index entries for sequences related to 
               sorting</a>
%Y A003070 Cf. A036604. Essentially the same as A072831.
%Y A003070 Sequence in context: A092757 A062430 A016040 this_sequence A036604 A001768 
               A089108
%Y A003070 Adjacent sequences: A003067 A003068 A003069 this_sequence A003071 A003072 
               A003073
%K A003070 nonn
%O A003070 1,3
%A A003070 N. J. A. Sloane (njas(AT)research.att.com).