Let $\rm\:w = 1+\sqrt{3}.\:$ $\rm\:w^n$ has $\sqrt{3}\:$ coefficient $\rm\,b_n$ satisfying $\rm\:b_{n+2} = \color{#C00}2\:b_{n+1} + \color{#0A0}2\:b_n\:$ since $\rm\,w\,$ is a root of $\rm\:x^2 = \color{#C00}2\,x + \color{#0A0}2.\:$ Hence $\rm\,\ b_n = 0,\ 1,\ 2,\ 6,\ 16,\ 44,\ 120,\ 328,\,\ldots$ so $328$ is the answer. Details below.
Let $\rm\: w = 1\!+\!\sqrt{3},\:$ with conjugate $\rm\: \bar w = 1\!-\!\sqrt{3}.\:$ For $\rm\:v = a\!+\!b\,\sqrt{3}\:$ we get its $\sqrt{3}$ coefficient by
$$\rm\: b\ =\ \frac{v - \bar v}{2\sqrt{3}}\ =\ \frac{v - \bar v}{w -\bar w}\:$$
For $\rm\:v = w^n\:$ these coefficients $\rm\:b_n\:$ satisfy a recurrence based on the minimal polynomial of $\rm\:w\:$
$$\rm w^{n+2} - \bar w^{n+2}\, = \ (\color{#C00}{w + \bar w})\ (w^{n+1} - \bar w^{n+1})\ \color{#0A0}{-\ w\bar w}\ (w^{n} - \bar w^{n})$$
$\rm Dividing\ by\, \ \ w-\bar w\, \ \ yields \ \ \ b_{n+2}\ =\ \color{#C00}2\ b_{n+1} + \color{#0A0}2\ b_n,\ \ \ b_0 = 0,\ b_1 = 1\ \ for\ \ b_n = \dfrac{w^n - \bar w^n}{w - \bar w}$
See this answer for a simple operator-theoretic generalization of the above.
Remark $\ $ Sequeneces of the form $\rm\:\dfrac{w^n - \bar w^n}{w - \bar w}\:$ for $\rm\:w\:$ a quadratic algebraic number are known as Lucas sequences. Many special cases are well-known, e.g. the sequences of Fibonacci, Lucas, Pell, Jacobsthal, and Mersenne. These sequences arise when studying the arithmetic of quadratic number fields. The above recurrence is but one of many identities know for these and related sequences. See any of Paulo Ribenboim's "Number Records" books for many of their properties.
Note that if you express the recurrence in system (matrix) form, then you obtain a fast linear time algorithm for computing the coefficients, by repeatedly squaring matrices, just like the well-known Fibonacci case using their addition formula.