= Franel sum
{c}
{title2=$F_n=\sum_{k=0}^n\binom nk^3$}
A <Franel sum> adds fixed powers of the <binomial coefficients> in one row. A common convention uses the cubic sum
$$
F_n=\sum_{k=0}^n\binom nk^3.
$$
For example, $F_2=1^3+2^3+1^3=10$. More generally, the exponent can be specified explicitly as $F_n^{(r)}=\sum_{k=0}^n\binom nk^r$. For a positive <integer> $r$, each term counts ordered $r$-tuples of <subsets> of an $n$-element <set> that all have the same <cardinality> $k$. Summing over $k$ counts all such tuples. For $r=2$, <Vandermonde's identity> reduces the sum to the <central binomial coefficient> $\binom{2n}n$; the cubic case is a distinct sequence.
Back to article page