|
|
A094780
|
|
Let 2^k = smallest power of 2 >= binomial(2n,n); a(n) = 2^k - binomial(2n,n).
|
|
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;
refs;
listen;
history;
text;
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.
|
|
LINKS
|
|
|
EXAMPLE
|
C(30,15) = 155117520; 2^28 = 268435456; difference is 113317936.
k = 0, 1, 3, 5, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, ... - R. J. Mathar, Nov 15 2019
|
|
MAPLE
|
local cb, k ;
cb := binomial(2*n, n) ;
k := ceil(log[2](cb)) ;
2^k-cb ;
end proc:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|