Update README.md

README.md

@@ -1887,7 +1887,7 @@ Also families which contain only one very small prime > *b*: (this is because: f
 |27|2{0}J|2×27<sup>*n*+1</sup>+19 (*n* ≥ 0)|2J|73|always divisible by some element of {5,7,73}<br>divisible by 7 if *n* is odd, divisible by 5 if *n* == 2 mod 4, divisible by 73 if *n* == 0 mod 4|http://factordb.com/index.php?query=2*27%5E%28n%2B1%29%2B19&use=n&n=0&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
 |4|{1}|(4<sup>*n*</sup>−1)/3 (*n* ≥ 2)|11|5|difference-of-two-squares factorization<br>but 11 is prime, and 11 is the only prime > *b* in this family<br>(4<sup>*n*</sup>−1)/3 = (2<sup>*n*</sup>−1) × (2<sup>*n*</sup>+1) / 3|http://factordb.com/index.php?query=%284%5En-1%29%2F3&use=n&n=2&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
 |8|{1}|(8<sup>*n*</sup>−1)/7 (*n* ≥ 2)|111|73|difference-of-two-cubes factorization<br>but 111 is prime, and 111 is the only prime > *b* in this family<br>(8<sup>*n*</sup>−1)/7 = (2<sup>*n*</sup>−1) × (4<sup>*n*</sup>+2<sup>*n*</sup>+1) / 7|http://factordb.com/index.php?query=%288%5En-1%29%2F7&use=n&n=2&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
-|16|{1}|(16<sup>*n*</sup>−1)/15 (*n* ≥ 2)|11|17|difference-of-two-squares factorization<br>but 11 is prime, and 11 is the only prime > *b* in this family<br>(16<sup>*n*</sup>−1)/15 = (4<sup>*n*</sup>−1) × (4<sup>*n*</sup>+1) / 15<br>(in fact, difference-of-4th-powers factorization)<br>(16<sup>*n*</sup>−1)/15 = (2<sup>*n*</sup>−1) × (2<sup>*n*</sup>+1) × (4<sup>*n*</sup>+1) / 15<br>(in fact, also combine of difference-of-8th-powers factorization and Aurifeuillean factorization of *x*<sup>8</sup>−16×*y*<sup>8</sup>)<br>(16<sup>*n*</sup>−1)/15 = (2<sup>*n*/2</sup>−1) × (2<sup>*n*/2</sup>+1) × (2<sup>*n*</sup>+1) × (4<sup>*n*</sup>+1) / 15 if *n* is even, (16<sup>*n*</sup>−1)/15 = (2<sup>*n*</sup>−1) × (2<sup>*n*</sup>+1) × (2<sup>*n*</sup>−2<sup>(*n*+1)/2</sup>+1) × (2<sup>*n*</sup>+2<sup>(*n*+1)/2</sup>+1) / 15 if *n* is odd|http://factordb.com/index.php?query=%2816%5En-1%29%2F15&use=n&n=2&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
+|16|{1}|(16<sup>*n*</sup>−1)/15 (*n* ≥ 2)|11|17|difference-of-two-squares factorization<br>but 11 is prime, and 11 is the only prime > *b* in this family<br>(16<sup>*n*</sup>−1)/15 = (4<sup>*n*</sup>−1) × (4<sup>*n*</sup>+1) / 15<br>(in fact, difference-of-two-4th-powers factorization)<br>(16<sup>*n*</sup>−1)/15 = (2<sup>*n*</sup>−1) × (2<sup>*n*</sup>+1) × (4<sup>*n*</sup>+1) / 15<br>(in fact, also combine of difference-of-8th-powers factorization and Aurifeuillean factorization of *x*<sup>8</sup>−16×*y*<sup>8</sup>)<br>(16<sup>*n*</sup>−1)/15 = (2<sup>*n*/2</sup>−1) × (2<sup>*n*/2</sup>+1) × (2<sup>*n*</sup>+1) × (4<sup>*n*</sup>+1) / 15 if *n* is even, (16<sup>*n*</sup>−1)/15 = (2<sup>*n*</sup>−1) × (2<sup>*n*</sup>+1) × (2<sup>*n*</sup>−2<sup>(*n*+1)/2</sup>+1) × (2<sup>*n*</sup>+2<sup>(*n*+1)/2</sup>+1) / 15 if *n* is odd|http://factordb.com/index.php?query=%2816%5En-1%29%2F15&use=n&n=2&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
 |27|{1}|(27<sup>*n*</sup>−1)/26 (*n* ≥ 2)|111|757|difference-of-two-cubes factorization<br>but 111 is prime, and 111 is the only prime > *b* in this family<br>(27<sup>*n*</sup>−1)/26 = (3<sup>*n*</sup>−1) × (9<sup>*n*</sup>+3<sup>*n*</sup>+1) / 26|http://factordb.com/index.php?query=%2827%5En-1%29%2F26&use=n&n=2&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
 |27|{2}7|(27<sup>*n*+1</sup>+64)/13 (*n* ≥ 1)|27|61|sum-of-two-cubes factorization<br>but 27 is prime, and 27 is the only prime > *b* in this family<br>(27<sup>*n*+1</sup>+64)/13 = (3<sup>*n*+1</sup>+4) × (9<sup>*n*+1</sup>−4×3<sup>*n*+1</sup>+16) / 13<br>(in fact, also combine of Aurifeuillean factorization of *x*<sup>4</sup>+4×*y*<sup>4</sup> and Aurifeuillean factorization of *x*<sup>6</sup>+27×*y*<sup>6</sup> and Aurifeuillean factorization of *x*<sup>12</sup>+46656×*y*<sup>12</sup>)<br>(27<sup>*n*+1</sup>+64)/13 = (3<sup>*n*+1</sup>+4) × (3<sup>*n*+1</sup>−2×3<sup>(*n*+2)/2</sup>+4) × (3<sup>*n*+1</sup>+2×3<sup>(*n*+2)/2</sup>+4) if *n* is even, (27<sup>*n*+1</sup>+64)/13 = (3<sup>(*n*+1)/2</sup>−2×3<sup>(*n*+1)/4</sup>+2) × (3<sup>(*n*+1)/2</sup>+2×3<sup>(*n*+1)/4</sup>+2) × (3<sup>*n*+1</sup>−2×3<sup>(3×*n*+3)/4</sup>+2×3<sup>(*n*+1)/2</sup>−4×3<sup>(*n*+1)/4</sup>+4) × (3<sup>*n*+1</sup>+2×3<sup>3×(*n*+1)/4</sup>+2×3<sup>(*n*+1)/2</sup>+4×3<sup>(*n*+1)/4</sup>+4) / 13 if *n* == 3 mod 4, (27<sup>*n*+1</sup>+64)/13 = (3<sup>*n*+1</sup>+4) × (3<sup>*n*+1</sup>−2×3<sup>(3×*n*+5)/4</sup>+2×3<sup>(*n*+3)/2</sup>−4×3<sup>(*n*+3)/4</sup>+4) × (3<sup>*n*+1</sup>+2×3<sup>(3×*n*+5)/4</sup>+2×3<sup>(*n*+3)/2</sup>+4×3<sup>(*n*+3)/4</sup>+4) if *n* == 1 mod 4|http://factordb.com/index.php?query=%2827%5E%28n%2B1%29%2B64%29%2F13&use=n&n=1&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|
 |27|{G}7|(8×27<sup>*n*+1</sup>−125)/13 (*n* ≥ 1)|G7|439|difference-of-two-cubes factorization<br>but G7 is prime, and G7 is the only prime > *b* in this family<br>(8×27<sup>*n*+1</sup>−125)/13 = (2×3<sup>*n*+1</sup>−5) × (4×9<sup>*n*+1</sup>+10×3<sup>*n*+1</sup>+25) / 13|http://factordb.com/index.php?query=%288*27%5E%28n%2B1%29-125%29%2F13&use=n&n=1&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1&sent=Show|