Quote:
Originally Posted by sweety439
Thus, for R4: (we should find n such that all of these formulas take prime values)
Code:
k formula(s)
1 {(1*2^n1)/3,1*2^n+1} (for even n) or {1*2^n1,(1*2^n+1)/3} (for odd n)
2 {2*4^n1}
3 {3*4^n1}
4 {2*2^n1,(2*2^n+1)/3} (for even n) or {(2*2^n1)/3,2*2^n+1} (for odd n)
5 {5*4^n1}
6 {6*4^n1}
7 {(7*4^n1)/3}
8 {8*4^n1}
9 {3*2^n1,3*2^n+1}
10 {(10*4^n1)/3}
11 {11*4^n1}
12 {12*4^n1}
13 {(13*4^n1)/3}
14 {14*4^n1}
15 {15*4^n1}
16 {(4*2^n1)/3,4*2^n+1} (for even n) or {4*2^n1,(4*2^n+1)/3} (for odd n)
17 {17*4^n1}
18 {18*4^n1}
19 {(19*4^n1)/3}
20 {20*4^n1}
21 {21*4^n1}
22 {(22*4^n1)/3}
23 {23*4^n1}
24 {24*4^n1}
25 {5*2^n1,(5*2^n+1)/3} (for even n) or {(5*2^n1)/3,5*2^n+1} (for odd n)

Note that all n must be >= 1 (we allow n = 1, but not allow n = 0 or n < 0)