Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067850
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067850 Highest power of 2 not exceeding n!. +0
13
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; listen)
OFFSET

0,4

COMMENT

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.

Sequence in context: A130664 A014011 A064424 this_sequence A130240 A143118 A162800

Adjacent sequences: A067847 A067848 A067849 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research