login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067850 Highest power of 2 not exceeding n!. 12
0, 0, 1, 2, 4, 6, 9, 12, 15, 18, 21, 25, 28, 32, 36, 40, 44, 48, 52, 56, 61, 65, 69, 74, 79, 83, 88, 93, 97, 102, 107, 112, 117, 122, 127, 132, 138, 143, 148, 153, 159, 164, 169, 175, 180, 186, 191, 197, 202, 208, 214, 219, 225, 231, 237, 242, 248, 254, 260, 266 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

2^a(n) <= n! < 2^[a(n)+1]

FORMULA

floor(log[2](n!)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 18 2002

MATHEMATICA

f[n_] := Block[{k = 0}, While[2^k <= n!, k++ ]; k--; k]; Table[ f[n], {n, 0, 60} ]

CROSSREFS

Cf. A000142.

Cf. A003070 (minimum number of bits to represent n!)

Sequence in context: A130664 A014011 A064424 * A130240 A143118 A162800

Adjacent sequences:  A067847 A067848 A067849 * A067851 A067852 A067853

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Feb 15 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 16 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.