elldivpol(E,n) or Sage's default E.division_polynomial(n) [3] for the short model $E:y^2=x^3+Ax+B$, then $f_n(x)=\psi_n(x)$ for odd $n$ and $f_n(x)=\psi_n(x,y)\cdot2y$ for even $n$. Sage's E.division_polynomial_0(n) [3] gives $\psi_n$ for odd $n$ and $\psi_n/(2y)$ for even $n$.S.<A,B> = QQ[]
F = S.fraction_field()
E = EllipticCurve(F, [A, B])
R.<x,y> = S[]
n = 8
q = sum(R(S(c))*x^i for i, c in enumerate(E.division_polynomial_0(n).list()))
psi = q if n % 2 else 2*y*q
psi # the row for n = 8, in the table's conventionThe generator computes in the coordinate ring of $y^2=x^3+Ax+B$, representing every polynomial as $u(x,A,B)+y\,v(x,A,B)$ and reducing products by the exact relation $y^2=x^3+Ax+B$.