update from Aidan

This commit is contained in:
Axel Kohlmeyer
2023-02-21 15:47:59 -05:00
parent 6c5c93438c
commit 1aa7a6c8b8

View File

@ -451,7 +451,10 @@ piece of python code:
for j in range(j1-j2,min(twojmax,j1+j2)+1,2):
if (j>=j1): print j1/2.,j2/2.,j/2.
For even twojmax = 2(*m*\ -1), :math:`K = m(m+1)(2m+1)/6`, the *m*\ -th pyramidal number. For odd twojmax = 2 *m*\ -1, :math:`K = m(m+1)(m+2)/3`, twice the *m*\ -th tetrahedral number.
There are :math:`m(m+1)/2` descriptors with last index *j*,
where *m* = :math:`\lfloor j \rfloor + 1`.
Hence, for even *twojmax* = 2(*m*\ -1), :math:`K = m(m+1)(2m+1)/6`, the *m*\ -th pyramidal number,
and for odd *twojmax* = 2 *m*\ -1, :math:`K = m(m+1)(m+2)/3`, twice the *m*\ -th tetrahedral number.
.. note::