From Weierstrass Approximation Theorem we know there is such a polynomial, moreover there are infinitely many polynomials satisfying given criterion. Therefore we would like to find those ones of the minimal order.
Since we are supposed to exploit series approximations we define a polynomial of n - th order approximating 6 ArcTan[x] for x such that (-(1/Sqrt[3]) <= x <= 1/Sqrt[3]) with the 10^(-5) accuracy. We can use a Taylor series of the given function:
poly[x_, n_Integer] /; n > 0 := Normal @ Series[ 6 ArcTan[x], { x, 0, n}]
Next we would like to minimize the "error" function like the following:
Abs[ poly[x, n] - 6 ArcTan[x]]
We could proceed further with symbolic functions however numeric ones can be much faster thus we can use NMaximize with the constraint -(1/Sqrt[3]) <= x <= 1/Sqrt[3]:
NMaximize[{ Abs[poly[x, n] - 6 ArcTan[x]], -(1/Sqrt[3]) <= x <= 1/Sqrt[3]}, x]
Finally we can exploit the new function in Mathematica 10 SelectFirst:
SelectFirst[ Table[{ n, First @ NMaximize[{ Abs[poly[x, n] - 6 ArcTan[x]], -(1/Sqrt[3]) <= x <= 1/Sqrt[3]}, x]}, {n, 4, 20}], Last[#] < 10^-5 &]
{17, 7.12022*10^-6}
So the minimal order polynomial is
poly[x, 17]
6 x - 2 x^3 + (6 x^5)/5 - (6 x^7)/7 + (2 x^9)/3 - (6 x^11)/11 + (6 x^13)/13 - (2 x^15)/5 + (6 x^17)/17
much lower order than you expected.
Edit
We have exploited Taylor series solutions, now we can optimize approximations based on another tools Mathematica can offer.
Another answer introduced LeastSquarePolynomial providing quite a good approximation however in case of more general functions or if better approximations are needed that might appear to be too computationally complex since it involves symbolic integration.
Therefore alternative approach is welcome. We provide another solution based on a simple algebraic functionality InterpolatingPolynomial (see e.g. this answer Get polynomial interpolation formula for an idea how it works)
intpoly[x_, n_] := Collect[ InterpolatingPolynomial[ Table[ {x, 6 ArcTan[x]}, {x, -1/Sqrt[3], 1/Sqrt[3], 1/(n Sqrt[3])}], x], x, Simplify]
Now this polynomial also satisfies conditions:
intpoly[x, 5] // N // TraditionalForm
Now let's compare graphically various approximations:
Plot[{ 6 ArcTan[x] - intpoly[x, 5], 6 ArcTan[x] - poly, 6 ArcTan[x] - intpoly[x, 6]}, {x, -1/Sqrt[3], 1/Sqrt[3]}, Evaluated -> True, PlotStyle -> Thick, PlotLegends -> "Expressions"]
and its absolute values:
Plot[{ Abs[6 ArcTan[x] - intpoly[x, 5]], Abs[6 ArcTan[x] - poly], Abs[6 ArcTan[x] - intpoly[x, 6]]}, {x, -1/Sqrt[3], 1/Sqrt[3]}, Evaluated -> True, PlotStyle -> Thick, PlotLegends -> "Expressions"]

We can clearly see that
intpoly[x, 6] // N // TraditionalForm

wins that comparison with respect to accuracy while intpoly[x, 5] and poly are of the minimal order (9). However one could probably find even lower order polynomials satisfying the criterion.
Taninstead ofArcTan. $\endgroup$Plot[{approx6arctan[x],ArcTan[x]},{x,-Pi,Pi}]$\endgroup$