Table 1.
Numerical summary of the first 10 cases of additional locations, τ, to add to each state k in the original set of discrete locations K. Here ϕ represents the total number of locations given τ and set K.
Case | τ | ϕ | τ, K = 1 | ϕ | τ K = 2 | ϕ | τ, K = 3 | ϕ | τ, K = 4 | ϕ | τ K = 5 | ϕ | τ K = 6 |
---|---|---|---|---|---|---|---|
|
|
|
|
|
|
|
|
1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 |
2 | 1 | 2 | 4 | 6 | 8 | 10 | 12 |
3 | 2 | 5 | 10 | 15 | 20 | 25 | 30 |
4 | 3 | 16 | 32 | 48 | 64 | 80 | 96 |
5 | 4 | 65 | 130 | 195 | 260 | 325 | 390 |
6 | 5 | 326 | 652 | 978 | 1,304 | 1,630 | 1,956 |
7 | 6 | 1,957 | 3,914 | 5,871 | 7,828 | 9,785 | 11,742 |
8 | 7 | 13,700 | 27,400 | 41,100 | 54,800 | 68,500 | 82,200 |
9 | 8 | 109,601 | 219,202 | 328,803 | 438,404 | 548,005 | 657,606 |
10 | 9 | 986,410 | 1,972,820 | 2,959,230 | 3,945,640 | 4,932,050 | 5,918,460 |