All Questions

The Fibonacci polynomials are defined recursively by $F_0(x)=0, F_1(x)=1$ and $F_n(x)=xF_{n-1}(x)+F_{n-2}(x)$, for $n\geq2$. While computing certain integrals, I observe the following (numerically) ...

This is inspired by the same beautiful integral expression for $\zeta(3)$ as this question, but goes in a slightly different direction. Writing the original integral in the form $$\int_0^1\frac{x(1-x)}...