id:A046820 - OEIS Search Results

Search: id:A046820

Displaying 1-1 of 1 results found.

page 1

Number of 1's in binary expansion of 5n.

+0
1

0, 2, 2, 4, 2, 3, 4, 3, 2, 4, 3, 5, 4, 2, 3, 4, 2, 4, 4, 6, 3, 4, 5, 5, 4, 6, 2, 4, 3, 3, 4, 5, 2, 4, 4, 6, 4, 5, 6, 4, 3, 5, 4, 6, 5, 4, 5, 6, 4, 6, 6, 8, 2, 3, 4, 4, 3, 5, 3, 5, 4, 4, 5, 6, 2, 4, 4, 6, 4, 5, 6, 5, 4, 6, 5, 7, 6, 3, 4, 5, 3, 5, 5, 7, 4, 5, 6, 6, 5, 7, 4, 6, 5 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`a(n) is also the largest integer such that 2^a(n) divides binomial(10n,5n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 27 2002`
	LINKS	`Michael Gilleland, Some Self-Similar Integer Sequences`
	FORMULA	`a(n)=floor(log(gcd(binomial(10n, 5n), 2^floor(log(binomial(10n, 5n))/log(2))))/log(2)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 27 2002`
	CROSSREFS	`Sequence in context: A061338 A135714 A103274 this_sequence A043262 A130860 A161535` `Adjacent sequences: A046817 A046818 A046819 this_sequence A046821 A046822 A046823`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research