Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Proth prime 2 1"
(Thomas Ritschel's calculator gives a weight of 39 for Proth k=1.) |
(add near Cullen primes) |
||
Line 9: | Line 9: | ||
|PNlist= | |PNlist= | ||
1 | 1 | ||
− | 2;T:GT | + | 2;T:GT;C:{{NCu|+|1}}, {{NCu|-|2}} |
− | 4;T:G | + | 4;T:G;C:{{NCu|-|3}} |
8;T:G | 8;T:G | ||
16;T:G | 16;T:G | ||
|PRemarks=These n-values form the [[Fermat number|Fermat primes]]. | |PRemarks=These n-values form the [[Fermat number|Fermat primes]]. | ||
}} | }} |
Revision as of 13:46, 16 October 2024
Reserved! This sequence is currently reserved by: FermatSearch |
Current data
|
|
Remarks : |
These n-values form the Fermat primes. |
Notes
- ↑ Is GF Divisor of xGF(1,4,3) [+15], Twin n=2, Near Cullen 2•21+1, Near Cullen 1•22+1
- ↑ Is GF Divisor of GF(3,3) [+34], Near Cullen 2•23+1
- ↑ Is GF Divisor of GF(7,3) [+39]
- ↑ Is GF Divisor of GF(15,3) [+39]