|
|
A355256
|
|
a(n) is the number of n-th order n X n magic arrays composed of the numbers from 1 to n^2 in which each 2 X 2 subsquare has the same sum, counted up to rotations and reflections.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 2 the a(2) = 3 solutions are (1 2; 3 4), (1 2; 4 3) and (1 3; 4 2).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|