Construktion
odd

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

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

n ≠ 3k

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

n prime

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

Magic squares of odd order: n≠3k

The are some wellknown algorithms to construct magic squares of odd order, when the order n is not a multiple of 3.

You will find more methods to create magic squares of odd order in section pandiagonal squares.

	Method
	Margossian (Method 1)
	Margossian (Method 2)
	Lehmer (Uniform step)
	Poignard
	Sauveur (Method of indexing)