id:A094780 - OEIS Search Results

Search: id:A094780

Displaying 1-1 of 1 results found.

page 1

Let 2^k = smallest power of 2 >= binomial(2n,n); a(n) = 2^k - binomial(2n,n).

+0
2

0, 0, 2, 12, 58, 4, 100, 664, 3514, 16916, 77388, 343144, 1490148, 6376616, 26992264, 113317936, 472661434, 1961361076, 8104733884, 33374212936, 137031378124, 11497939448, 94924291832, 562662294608, 2936768405732, 14326881917576, 67031420473208, 304860388037136 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Suggested by reading the Knuth article.`
	REFERENCES	`D. E. Knuth, Efficient balanced codes, IEEE Trans. Inform. Theory, 32 (No. 1, 1986), 51-53.`
	EXAMPLE	`C(30,15) = 155117520; 2^28 = 268435456; difference is 113317936.`
	CROSSREFS	`Cf. A093387, A094779.` `Sequence in context: A098453 A067125 A005038 this_sequence A100103 A054145 A001758` `Adjacent sequences: A094777 A094778 A094779 this_sequence A094781 A094782 A094783`
	KEYWORD	`nonn`
	AUTHOR	`njas, Jun 10 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research