id:A092607 - OEIS Search Results

Search: id:A092607

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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, 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, 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 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`a(n) = A038374(A000142(n)).`
	LINKS	`Index entries for sequences related to binary expansion of n` `I ndex entries for sequences related to factorial numbers.`
	EXAMPLE	`n=10: 10!=3628800 = '1101110101111100000000' = '.........11111........': a(10)=5.`
	CROSSREFS	`Cf. A036603, A007088.` `Adjacent sequences: A092604 A092605 A092606 this_sequence A092608 A092609 A092610` `Sequence in context: A131287 A102640 A123674 this_sequence A057939 A061338 A135714`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 11 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research