deletions | additions       diff --git a/Finding the Sequences.tex b/Finding the Sequences.tex  index 5de05bd..1818536 100644  --- a/Finding the Sequences.tex  +++ b/Finding the Sequences.tex 
...
\section{Finding the Sequences}  So categorising the sequences $D_k$ for the $k^{th}$-least $k^th$-least  significant digit, we have \begin{equation} D_0 = 2,4,8,6... \;\; p:4 \;\; OEIS:A000689 \\ \\  D_1 = 0|0,0,1,3,6,2,5,1,2,4,9,9,8,6,3,7,4,8,7,5...\;\; p:20 \;\; OEIS:A160590 \\ \\ 
...
Asessing the occurence of each number within $D_1$, apart from the prepended $0$, we have each digit $d\in[0,9]$ occurring exactly twice. Therefore we may express \begin{equation}  0,0,1,3,6,2,5,1,2,4,9,9,8,6,3,7,4,8,7,5... \\  Pv=D_1 \\  \begin{bmatrix}  1&0&0&0&0&0&0&0&0&0&0&0&0&0&0&0&0&0&0&0\\