login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094780 Let 2^k = smallest power of 2 >= binomial(2n,n); a(n) = 2^k - binomial(2n,n). 1
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; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

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: A067125 A177782 A005038 * A100103 A054145 A001758

Adjacent sequences:  A094777 A094778 A094779 * A094781 A094782 A094783

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 10 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 20:48 EST 2012. Contains 206085 sequences.