|
Search: id:A094779
|
|
|
| A094779 |
|
Let 2^k = smallest power of 2 >= binomial(n,[n/2]); a(n) = 2^k - binomial(n,[n/2]). |
|
+0
2
|
|
| 0, 0, 0, 1, 2, 6, 12, 29, 58, 2, 4, 50, 100, 332, 664, 1757, 3514, 8458, 16916, 38694, 77388, 171572, 343144, 745074, 1490148, 3188308, 6376616, 13496132, 26992264, 56658968, 113317936, 236330717, 472661434, 980680538, 1961361076, 4052366942, 8104733884
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
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, A094780.
Sequence in context: A141447 A122746 A057582 this_sequence A093387 A143176 A081375
Adjacent sequences: A094776 A094777 A094778 this_sequence A094780 A094781 A094782
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 10 2004
|
|
|
Search completed in 0.002 seconds
|
