|
Search: id:A003070
|
|
|
| A003070 |
|
Ceiling (log_2 n!).
(Formerly M2407)
|
|
+0
6
|
|
| 0, 1, 3, 5, 7, 10, 13, 16, 19, 22, 26, 29, 33, 37, 41, 45, 49, 53, 57, 62, 66, 70, 75, 80, 84, 89, 94, 98, 103, 108, 113, 118, 123, 128, 133, 139, 144, 149, 154, 160, 165, 170, 176, 181, 187, 192, 198, 203, 209, 215, 220, 226, 232, 238, 243, 249
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.3.1.
E. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms, Prentice-Hall, 1977, section 7.4.
Tianxing Tao, Om optimal arrangement of 12 points, pp. 229-234 in Combinatorics, Computing and Complexity, ed. D. Du and G. Hu, Kluwer, 1989.
|
|
LINKS
|
Index entries for sequences related to sorting
|
|
CROSSREFS
|
Cf. A036604. Essentially the same as A072831.
Adjacent sequences: A003067 A003068 A003069 this_sequence A003071 A003072 A003073
Sequence in context: A079511 A062430 A016040 this_sequence A036604 A001768 A089108
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
