Let $a_1= 0,a_2=1$ and $a_n = \sqrt {\frac{{{a_{n - 1}} + {a_{n - 2}}}}{2} \cdot {a_{n - 1}}}$ for $n \geqslant 3$. Is it true that $\lim\limits_{n \to \infty } {a_n} = \frac{1}{\pi}{\operatorname{B}}\left( {\frac{1}{2},\frac{3}{4}} \right)$, where $\operatorname{B}(x_1,x_2)$ is the Beta function?
Having experimented with Maple and wxMaxima, I think this statement should be provable(?). For example, $a_{20}=.7627597635$ while $\frac{1}{\pi }{\rm B}\left( {\frac{1}{2},\frac{3}{4}} \right)=.7627597633...$.
I was also wondering whether this sequence is convergent, and I think I can show that. In fact, the subsequence $\langle a_{2n+1} \mid n\in\mathbb{N} \rangle$ is increasing while $\langle a_{2n} \mid n\in\mathbb{N} \rangle$ is decreasing and both subsequences are bounded, so they converge. Moreover, their limits are the same, so $\langle a_{n} \mid n\in\mathbb{N} \rangle$ converges, and even rough estimates show that the limit lies in $(0.758,0.766)$. But to show that it is exactly $\frac{1}{\pi }{\rm B}\left( {\frac{1}{2},\frac{3}{4}} \right)$ is more difficult. Nonetheless, I will write down the proof of convergence. Perhaps, it may hint somehow to ${\operatorname{B}}\left( {\frac{1}{2},\frac{3}{4}} \right)$ expressed as an infinite sum or infinite product or whatever.
Let's start with the observation that for all $n$: $0\leq a_{n}\leq1$. This holds since given two values in the interval $[0,1]$, their average and product lie again in this interval. So in particular the sequence $\langle a_{n} \mid n\in\mathbb{N} \rangle$ is bounded. What’s more, the subsequence $\langle a_{2n+1} \mid n\in\mathbb{N} \rangle$ is increasing while $\langle a_{2n} \mid n\in\mathbb{N} \rangle$ is decreasing. We shall prove this by induction, making use of the well known inequality $\sqrt{x y}\leq{\frac{x+y}{2}}$. Hence we get $$\tag{1}a_{n-2}^{\frac{1}{4}}\cdot a_{n-1}^{\frac{3}{4}}\leq a_{n}\leq\frac{a_{n-2}}{4}+\frac{3a_{n-1}}{4}$$
Now we can prove that for all $n$ we have
$$\tag{2}a_{1}\lt \cdots\lt a_{2n-1}$$
$$\tag{3}a_{2}\gt \cdot\cdot\cdot\gt a_{2n}$$
$$\tag{4}a_{2n-1}\lt a_{2n}$$
For $n=1$ we see that (2) and (3) are vacuously true and (4) is obvious. And for the induction step we have to show $$\tag{5}a_{2n-1}\lt a_{2n+1}\lt a_{2n+2}\lt a_{2n}$$
We start by observing that $$\tag{6}a_{2n+1}\lt a_{2n}$$
since by definition $\displaystyle a_{2n+1}=\sqrt{\frac{a_{2n-1}+a_{2n}}{2}\cdot a_{2n}}$ and from (4) it follows that $\displaystyle{\frac{a_{2n-1}+a_{2n}}{2}}\,\lt \,a_{2n}$.
Now for the first inequality of (5), note that by the first inequality of (1) we have $a_{2n+1}^{4}\ge a_{2n-1}\cdot a_{2n}^{3}$, and by (6) this is greater than $a_{2n-1}\cdot a_{2n+1}^{3}$, so $a_{2n+1}\gt a_{2n-1}$ as required. Similarly, $a_{2n+2}^{4}\geq a_{2n}\cdot a_{2n+1}^{3}\gt a_{2n+1}^{4}$, which proves the second inequality of (5). For the last inequality of (5) we use the second inequality of (1), so $\displaystyle a_{2n+2}\,\leq\,\frac{a_{2n}+3a_{3n+1}}{4\,a n+1}\,\lt \,a_{2n}$ (by (6)). That completes the induction proof.
Now we can easily prove that both subsequences converge to the same limit. This is because by (1) $\displaystyle a_{2n+2}-a_{2n+1}\leq{\frac{a_{2n}-a_{2n+1}}{4}}$ and by (5) this last difference is less than $\displaystyle\frac{a_{2n}-a_{2n-1}}{4}$. So the distance between $a_{2n+2}$ and $a_{2n+1}$ is less than a quarter of the distance between $a_{2n}$ and $a_{2n-1}$, and therefore these distances go to zero. That implies both subsequences have the same limit.
Regarding the value $l$ of the limit, if - inspired by (1) - we define the sequence $\langle b_{n}|n\in\mathbb{N}\rangle $ by $\displaystyle b_{n}={\frac{b_{n-2}}{4}}+{\frac{3b_{n-1}}{4}}$ and $b_1=0,b_2=1$, then clearly $a_{n}\leq b_{n}$. Also, it is not hard to prove that $\displaystyle b_{n}=\frac{4}{5}\left(1-\left(-{\frac{1}{4}}\right)^{n-1}\right)$, which converges to $0.8$. In the same way, if we define $c_{n}=c_{n-2}^{\frac{1}{4}}\cdot c_{n-1}^{\frac{3}{4}}$, then we better ignore the initial value $0$, so we just put $c_{2}=1,c_{3}=a_{3}={\sqrt{\frac{1}{2}}}$ and when we switch to $d_{n}:=\log_{2}c_{n}$, then $d_{2}=0,d_{3}=-{\frac{1}{2}}$ and $d_n$ satisfies the same recurrence relation as $b_n$. Therefore, for $n≥2$, $\displaystyle d_{n}=\frac{2}{5}\left(-1+\left(-\frac{1}{4}\right)^{n-2}\right)$, which converges to $-\frac{2}{5}$, so $c_n$ converges to $2^{-{\frac{2}{5}}}$, which is approximately $0.758$.
In fact, returning to $b_n$, but using initial values $b_{2}=1,b_{3}=a_{3}={\sqrt{\frac{1}{2}}}$, we can show $b_n$ converges to $\displaystyle\frac{1+2{\sqrt{2}}}{5}$, which is approximately $0.766$.