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.

A092607 Length of longest contiguous block of ones in binary representation of n!.

This page as a plain text file.
%I A092607 #20 Jul 30 2025 09:46:14
%S A092607 1,1,1,2,2,4,2,3,3,2,5,2,6,3,3,3,3,6,5,3,5,5,5,6,4,6,6,6,4,5,6,3,3,7,
%T A092607 6,5,5,12,8,10,8,5,5,7,6,5,8,9,8,6,4,6,7,7,7,6,8,5,8,8,7,5,9,8,8,7,7,
%U A092607 11,7,7,8,14,10,9,7,7,7,6,7,8,10,8,10,9,7,7,5,7,7,7,9,8,7,8,10,6,8,7
%N A092607 Length of longest contiguous block of ones in binary representation of n!.
%H A092607 Amiram Eldar, <a href="/A092607/b092607.txt">Table of n, a(n) for n = 0..10000</a>
%H A092607 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>.
%H A092607 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%F A092607 a(n) = A038374(A000142(n)).
%e A092607 n = 10: 10! = 3628800 = '1101110101111100000000' = '.........11111........': a(10) = 5.
%t A092607 a[n_] := Max[Length /@ Split[IntegerDigits[n!, 2]][[1 ;; -1 ;; 2]]]; Array[a, 100, 0] (* _Amiram Eldar_, Jul 29 2025 *)
%Y A092607 Cf. A000142, A007088, A036603, A038374.
%K A092607 nonn,base
%O A092607 0,4
%A A092607 _Reinhard Zumkeller_, Apr 11 2004