id:A090621 - OEIS Search Results

Search: id:A090621

Displaying 1-1 of 1 results found.

page 1

Highest power of 16 dividing n!.

+0
2

0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19 (list; graph; listen)

	OFFSET	`0,11`
	FORMULA	`a(n) =A090622(n, 16) =[A011371(n)/4] =[A090616(n)/2] =[([n/2]+[n/4]+[n/8]+[n/16]+...)/4]. Almost n/4.`
	EXAMPLE	`a(10)=2 since 10!=3628800=16^2*14175`
	CROSSREFS	`Cf. A011371, A054861, A090616, A027868, A054896, A090617, A090618, A090619, A090620.` `Sequence in context: A120450 A127238 A072114 this_sequence A029378 A053278 A035466` `Adjacent sequences: A090618 A090619 A090620 this_sequence A090622 A090623 A090624`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Dec 06 2003`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research