Octagon Algorithm for Border Wheel Squares (Part XII)

Picture of a wheel

The Eight Node Way - (1,4,7) Squares

The previous section Part XI introduced the Octagon I and L algorithm for the construction of 5×5 thru 7×7 Wheel Border Squares (WBS). The type of Wheel Border squares investigated were the (a,d,f) type. This part will continue with 9×9 squares using the consecutive numbers (c,d,r) as the last cells in the central, diagonal and row spokes adjacent to the center cell in the square.

We have to decide what consecutive three numbers to place into the empty cells so that each row, column and diagonal of the central 3×3 square sums to 123. The triplet of numbers (22,23,24) to (34,35,36) in Table Ib fit the description since they will be shown not to be present as numbers in the other spoke cells. Thus, these triplets will have the requisite properties, since the rest of the even triplets will have at least one number in common with a number in every spoke of the wheel:

Table Ia
Even c
2,3,4
4,5,6
6,7,8
8,9,10
10,11,12
12,,13,14
14,15,16
16,17,18
18,19,20
Table Ib
Even c
20,21,22
22,23,24
24,25,26
26,27,28
28,29,30
30,31,32
32,33,34
34,35,36
36,37,38

It was mentioned in Part XI that 4n+1 odd order squares (5,9,13...) use the even c and the 4n+3 order squares (3,7,11...) use the odd c. This is due to the fact that the last numbers to be included in a triplet are even for the 4n+1 and odd for the 4n+3. What this means as shown in Table Ia is that the number one will always be unpaired when c is even but not when c is odd.

It was also shown in Part XI that when the initial numbers in the spoke are (1,4,7) that one 5th order square and three 7th order squares are formed. This section will show that the number of 9th order squares is seven and when tables similar to Ib are constructed for higher nth order squares that the number of terms follows the sequence:

Table II
5791113151719...
1371321314357...

The sequence is identical to that stored in the OEIS database under the Sloane number A002061 having the formula:

n2 − n + 1

where n ≥ 1 in our case. We can convert this formula so that n is based on the order n as in Table II. Taking n to be the value as was shown in Part VIII we obtain the last equation based on the order n:

(n − 3)/2
[(n − 3)/2]2 − (n − 3)/2 + 1
(n2 − 8n + 19)/4

Moreover, the equation turned out to be more than just an equation for Δ=7, for it eventually led to the sequence of equations in Table I, column two of Part VIII, where most of the sequences in a row were checked in the OEIS database and the equations listed there converted to those based on nth order using (n − 3)/2 substituted into n. Thus, each row now consisted of its own quadratic equation for producing all the terms within that row and only that row.

The Seven 9×9 Squares

This section will only deal with numbers (after the main diagonal is filled) that run in the order 1 (top center), 4 (bottom right) and 7 (left center). A difference (Δ) of 7 is then added to each of the numbers followed by either of the three triplets in Table Ib those triplets without a common number in the spokes. But before that the wheel portion of the square is filled according to Part X, using the blue color values from Table Ib ensures that in the internal 3×3 square every row, column and diagonal adds up to the magic sum of 123. The second part of the build up of the square is addition of the non spoke cells employing the following two algorithms, using graph theory, as was done previously in Part X.

Picture of an octagon

Final construction of the squares involve employing the Octagon I algorithm for the blue color cells and the L algorithm for the green color cells. All seven of the possible squares are shown below:

Border 9a(22,23,24)il
787972 661 179 245
67157 54829 24 4476
132764 5015 334355 69
625147 5922 42353120
714 2124 4158 6168 75
193034 4060 23485263
705639 3267 49182612
773825 287453 58115
37310 1681 6573804
   
Border 9a(24,25,26)il
787972 661 179 245
67159 53830 22 4476
132564 4915 344357 69
625046 5724 42363220
714 2126 4156 6168 75
193135 4058 25475163
705539 3367 48182712
773823 297452 60115
37310 1681 6573804
Border 9a(26,27,28)il
787972 661 179 245
67159 53830 22 4476
132564 4915 344357 69
625046 5526 42363220
714 2128 4154 6168 75
193135 4056 27475163
705839 3367 48182412
773823 297452 60115
37310 1681 6573804
   
Border 9a(28,29,30)il
787972 661 179 245
67159 56827 22 4476
132564 4915 344357 69
625046 5328 42363220
714 2130 4152 6168 75
193135 4054 29475163
705839 3367 48182412
773823 267455 60115
37310 1681 6573804
Border 9a(30,31,32)il
787972 661 179 245
67159 56827 22 4476
132564 4915 344357 69
625346 5130 42362920
714 2132 4150 6168 75
192835 4052 31475463
705839 3367 48182412
773823 267455 60115
37310 1681 6573804
   
Border 9a(32,33,34)il
787972 661 179 245
67159 56827 22 4476
132564 5215 314357 69
625346 4932 42362920
714 2134 4148 6168 75
192835 4050 33475463
705839 3067 51182412
773823 267455 60115
37310 1681 6573804

The last square shows what happens when we use an odd parity table for the internal 3×3 square. Two unpaired (non adjacent numbers in red) are left over to pair up at the end, producing a non magic square where columns 3 and 7 sum to 366 and 372, respectively.

Border 9a(34,35,36)il
787972 661 179 245
67159 56827 22 4476
132564 5215 314357 69
625349 4734 42332920
714 2136 4146 6168 75
192832 4048 35505463
705839 3067 51182412
773823 267455 60115
37310 1681 6573804
   
Non Border 9a(33,34,35)il
787972 661 179 245
67159 56827 22 4476
132564 5215 314357 69
625346 6033 42362920
714 2135 4159 6168 75
192832 4061 34505463
705839 3067 51182412
773823 267455 60115
37310 1681 6573804

This completes the Octagon I and L method. Go to Part XIII for initial numbers 3, 5, 7, 9, 11, and 13 in a 9×9 square. Go back to Part XI. Go back to homepage.


Copyright © 2022 by Eddie N Gutierrez. E-Mail: enaguti1949@gmail.com