cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A067850 Highest power of 2 not exceeding n!.

This page as a plain text file.
%I A067850 #15 Sep 08 2022 08:45:05
%S A067850 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,
%T A067850 83,88,93,97,102,107,112,117,122,127,132,138,143,148,153,159,164,169,
%U A067850 175,180,186,191,197,202,208,214,219,225,231,237,242,248,254,260,266
%N A067850 Highest power of 2 not exceeding n!.
%C A067850 2^a(n) <= n! < 2^[a(n)+1]
%H A067850 Amiram Eldar, <a href="/A067850/b067850.txt">Table of n, a(n) for n = 0..10000</a>
%F A067850 floor(log[2](n!)). - _Vladeta Jovovic_, Feb 18 2002
%t A067850 f[n_] := Block[{k = 0}, While[2^k <= n!, k++ ]; k--; k]; Table[ f[n], {n, 0, 60} ]
%o A067850 (Magma) [Floor(Log(2,Factorial(k))):k in [0..60]]; // _Marius A. Burtea_, Nov 06 2019
%Y A067850 Cf. A000142.
%Y A067850 Cf. A003070 (minimum number of bits to represent n!)
%K A067850 nonn
%O A067850 0,4
%A A067850 _Lekraj Beedassy_, Feb 15 2002
%E A067850 Edited and extended by _Robert G. Wilson v_, Feb 16 2002