login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067850 Highest power of 2 not exceeding n!. 15
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; text; internal format)
OFFSET

0,4

COMMENTS

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

LINKS

Amiram Eldar, Table of n, a(n) for n = 0..10000

FORMULA

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

MATHEMATICA

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

PROG

(MAGMA) [Floor(Log(2, Factorial(k))):k in [0..60]]; // Marius A. Burtea, Nov 06 2019

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, Feb 15 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v, Feb 16 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 23:15 EDT 2020. Contains 333260 sequences. (Running on oeis4.)