Benedict Irwin edited section_Describing_the_Generating_Functions__.tex  about 8 years ago

Commit id: aabfc5b912bc2e7051283f833ba685ad916df409

deletions | additions      

       

\end{equation}  We find they begin $1,12,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,8,4,2,4,2,4,14,4,6,2,10,2,6,6,4,2,4,6,2,10,2,4,2,12,10,2...$, up to the 45th term from 0th, (more to come later). This adds power to the statement second coefficient is given by $p_n-1$, however removes the highest coefficient being $p_n-1$ theory.  \begin{equation}  \chi_{13}(n)=\begin{cases}  1 & n=0,480\\  2 & n=4,7,10,14,17,...\\ 

0 & \mathrm{ow.}  \end{cases}  \end{equation}