|
Search: id:A005650
|
|
|
| A005650 |
|
Number of "magic squares" of order n (see comment line for exact definition).
(Formerly M2704)
|
|
+0
2
|
|
| 1, 1, 3, 7, 47, 207, 2249, 14501, 216273, 1830449, 34662523, 362983263, 8330310559, 103938238111, 2801976629841, 40574514114061, 1256354802202337, 20708839411614753, 724160187180691379, 13386284447024070647
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This is the number of n X n square arrays with nonnegative integer entries in which every row and column add to 2 (A000681) normalized by dividing by n!/2^[n/2].
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 125, #25, A_n.
|
|
LINKS
|
Index entries for sequences related to magic squares
|
|
FORMULA
|
a(n) = A000681(n)*2^[n/2]/n!.
|
|
CROSSREFS
|
Sequence in context: A007670 A074714 A064457 this_sequence A020754 A052381 A031440
Adjacent sequences: A005647 A005648 A005649 this_sequence A005651 A005652 A005653
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 11 2001
|
|
|
Search completed in 0.002 seconds
|
