Fungrim home page

Fungrim entry: ac4d13

k=0n(nk)Fk=F2n\sum_{k=0}^{n} {n \choose k} F_{k} = F_{2 n}
Assumptions:nZ0n \in \mathbb{Z}_{\ge 0}
\sum_{k=0}^{n} {n \choose k} F_{k} = F_{2 n}

n \in \mathbb{Z}_{\ge 0}
Fungrim symbol Notation Short description
Sumnf(n)\sum_{n} f(n) Sum
Binomial(nk){n \choose k} Binomial coefficient
FibonacciFnF_{n} Fibonacci number
ZZGreaterEqualZn\mathbb{Z}_{\ge n} Integers greater than or equal to n
Source code for this entry:
    Formula(Equal(Sum(Mul(Binomial(n, k), Fibonacci(k)), For(k, 0, n)), Fibonacci(Mul(2, n)))),
    Assumptions(Element(n, ZZGreaterEqual(0))))

Topics using this entry

Copyright (C) Fredrik Johansson and contributors. Fungrim is provided under the MIT license. The source code is on GitHub.

2021-03-15 19:12:00.328586 UTC