If $\sum_{r=1}^{30} \frac{r^2({}^{30}C_r)^2}{{}^{30}C_{r-1}} = \alpha \times 2^{29}$,then $\alpha$ is equal to

The value of $-{ }^{15}C_{1} + 2 \cdot { }^{15}C_{2} - 3 \cdot { }^{15}C_{3} + \ldots - 15 \cdot { }^{15}C_{15} + { }^{14}C_{1} + { }^{14}C_{3} + { }^{14}C_{5} + \ldots + { }^{14}C_{11}$ is

If $\sum\limits_{K = 1}^{12} {12K \cdot {^{12}C_K} \cdot {^{11}C_{K - 1}}} $ is equal to $\frac{{12 \times 21 \times 19 \times 17 \times \dots \times 3}}{{11!}} \times {2^{12}} \times p$,then $p$ is:

If $(1 + x)^n = \sum\limits_{r = 0}^n {{C_r}{x^r}} $,then $\left( {1 + \frac{{{C_1}}}{{{C_0}}}} \right)\left( {1 + \frac{{{C_2}}}{{{C_1}}}} \right)....\left( {1 + \frac{{{C_n}}}{{{C_{n - 1}}}}} \right) = $

If $(1+x)^n = \sum_{r=0}^n C_r x^r$,then the value of $C_0 + (C_0 + C_1) + (C_0 + C_1 + C_2) + \ldots + (C_0 + C_1 + C_2 + \ldots + C_n)$ is

$A$ binary sequence is an array of $0$'s and $1$'s. The number of $n$-digit binary sequences which contain an even number of $0$'s is