Let $ \sum_{k=0}^{n+1} C_k^n = \sum_{k=0}^{n} \binom{n}{k} + \binom{n}{n+1}$.
We understand that when n is a positive integer, $\binom{n}{k}= 0$ if $k > n$ and also if $k <0$.
Thus $\binom{n}{n+1} = 0$, leading to $\sum_{k=0}^{n} \binom{n}{k}=2^n$ and $\sum_{k=0}^{n+1} C_k^n =2^n$.
Thus $2^n = 512=2^9$ so n=9.
As before the summation from k=0 to n is also 512.
Final Answer: The final answer is $\boxed{512}$
If
$ 2^m 3^n 5^k, \text{ where } m, n, k \in \mathbb{N}, \text{ then } m + n + k \text{ is equal to:} $
Let $ (1 + x + x^2)^{10} = a_0 + a_1 x + a_2 x^2 + ... + a_{20} x^{20} $. If $ (a_1 + a_3 + a_5 + ... + a_{19}) - 11a_2 = 121k $, then k is equal to _______