deletions | additions       diff --git a/9090+3.tex b/9090+3.tex  index 172f15c..da7084c 100644  --- a/9090+3.tex  +++ b/9090+3.tex 
...
(90;;22)-1& 0 & 116548301×316802597×2462139382578592432493671937 \\  (90;;23)-1& 0 & 29×89×223×614701×25695112744556108783455528889830703 \\  \hline  \end{array}  \end{equation}  primes of form (90;;n)+1: 2, 3, 9, 15, 26, 33, 146, 320, 1068, 1505 \\  primes of form (90;;n)-1: 1, 3, 4, 11, 15, 21, \\  Now the second sequence doesn't appear to be recoginsed by OEIS. We require a way of finding the two sequences, then we may identify very large double primes.  According to "Wikipedia:Twin Prime" the largest twin prime pair found has each $200700$ digits. So we require a $(90;;100351)\pm1$ term or greater. This is still a huge task. We may be a ble to buil a similar algorithm to assess primality (or more strictly rule out non-primes). Together, the two algorithms may then sift out again more numbers, if we refine the search to twin primes, this would give some good numbers to focus on.  Building a similar table to before.  \begin{equation}  \begin{array}{|c|c|c|}  \hline  \end{array}  \end{equation}