Consider the function $t(x)$ defined as :
$$ x_1 = x $$ $$x_2 = x $$ $$ x_3 = 2 x^2 $$ $$ x_4 = 4 x^4 + 2 x^2 $$
and for $n > 4 $
$$ x_{n} = \frac { x_{n-1}^2 + x_{n-2}^2 + x_{n-3}^2}{x_{n-2} + x_{n-3} + x_{n-4} } $$
If the sequence converges to a constant then we define $t(x) = \lim x_n $.
This function is not so well understood by me.
I assume it is analytic for instance. But i have no formal proof.
The function grows fast. But I am not sure how fast exactly. ( ofcourse 10 iterations give a good asymptotic and then notice it goes double exponentially fast to its lim )
I have no series expansion , integral representation , differential equation , continued fraction or such for this. Nor do I have a way to compute these values in a different way such as different iterations , a koenigs type formula , combinatorical methods , fractals , cellular automatons , a bifurcation point , the area of a filled julia set etc etc.
practically there is not a big problem for small imput since it converges rapidly. But the values are mysterious to me.
In particular is $t(1)$ transcendental ?? Can we even prove it to be irrational ??
Do we have a closed form for $t(1)$ ? [ main question ! ]
This all reminds me of the Somos sequences and the Somos constant ( which has a closed form as the derivative of a lerch form ! )
Assuming it is analytic , how does its analytic continuation look like ? Is analytic continuation possible to any complex number or its neighbourhood , or is there a natural boundary ?
numerically we have
$$t(1) = 35.2850889...$$
Do you recognize this number ??
Is there a closed form ???
Has this been studied before ??
Edit
Some remark or motivation :
Notice that when you naively try to analyse this , after you know it converges fast you get
Set all $x_n = y$ for large $ n $ and some $ y > x > 1.$
$$ y = \frac{y^2 + y^2 + y^2}{y + y + y} $$
So
$$ y = 3 y^2 / (3y) $$
$$ y = y^2 / y $$
This is a tautology like $ z = z $. Useless.
It seems all naive methods lead to such tautologies.
This is the one of the simplest possible with sum of squares ; rational function iterations of degree $2.$
This only informally suggests the dependance of the starting value $x $ ofcourse.
Also there seems no link to iterations that solves equations like Newton iterations.
Therefore the recursion fascinates me.
Also notice $ t(x) $ is strictly increasing for $ x > 1.$

35.2850889285276615207652307264286692165640411569825581698414274720345996961636628369523260781462773487233897716541224894028653927496201757257239628652739126303264607314379854344783657207592433512446939836904309061986181584445582701842520656297136055578242086656685910819241234589915119952884871871455836385451305511968027345598378895550617584307050005261737969962713278718510530653467923189770181268049356579281058857417513652270481787930777146173840897413414293153707668060549844730768295099102778387454143886965495027043307047763137440562129240122196130975494994015741277121015923067889150106873
– Raymond Manzoni Oct 12 '19 at 11:24f(x,n)=local(x4=x,x3=x,x2=2x^2,x1=4x^4+2*x^2,xk);for(k=5,n,xk=(x1^2+x2^2+x3^2)/(x2+x3+x4);x4=x3;x3=x2;x2=x1;x1=xk);xk (pari/gp's script used to get more digits for @Claude and OP!). No closed form found yet...
– Raymond Manzoni Oct 12 '19 at 11:26