  I present a recursive formula for calculating the number of abelian squares
of length $n+n$ over an alphabet of size $d$. The presented formula is similar
to a previously known formula but has substantially lower complexity when $d\gg
n$.
