Pandiagonale magic squares: n = 4k

Construktion
pandiagonal

5	23	16	14	7
11	9	2	25	18
22	20	13	6	4
8	1	24	17	15
19	12	10	3	21

n = 3k

16	15	9	3	22
8	2	21	20	14
25	19	13	7	1
12	6	5	24	18
4	23	17	11	10

n ≠ 3k

10	11	17	23	4
18	24	5	6	12
1	7	13	19	25
14	20	21	2	8
22	3	9	15	16

n = 4k

21	3	10	12	19
15	17	24	1	8
4	6	13	20	22
18	25	2	9	11
7	14	16	23	5

n prime

9	12	20	23	1
18	21	4	7	15
2	10	13	16	24
11	19	22	5	8
25	3	6	14	17

special squares

24	3	7	11	20
12	16	25	4	8
5	9	13	17	21
18	22	1	10	14
6	15	19	23	2

Franklin squares

JavaScript-Error

Note: JavaScript is absolutely required for the functionality of these interactive pages and for the representation of all menus.

Please note also that you can deactivate JavaScript in general, but automatically activate it easily and without any risk for some special web pages like these. Here are the instructions how to enable JavaScript in your web browser

Pandiagonal: double-even order

Pandiagonal magic squares of double-even order are known since a long time. Some algorithms, which are easy to use with a computer, will be presented:

	Method		Method
	Aubry		Shen
	Barink		Wang Zhengyan
	Bouteloup		Woodruff
	Candy (Method 1)		Zhang Xiafu - Liang Peiji - Zhang Hangfu
	Candy (Method 2)		Unknown author (Method 1)
	Hendricks		Unknown author (Method 2)
	Planck		Unknown author (Method 3)
	Sayles		Unknown author (Method 4)
	Shabramallisi		Unknown author (Method 5)