login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051235 Number of essentially different most-perfect pandiagonal magic squares of order 4n. 1
1, 48, 368640, 22295347200, 932242784256000, 144982397807493120000, 221340898613898982195200000, 21421302878528360015430942720000, 59225618198555209770663470432256000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

K. Ollerenshaw and D. S. Bree, Most-perfect Pan-diagonal Magic Squares: Their Construction and Enumeration, Inst. Math. Applic., Southend-on-Sea, England, 1998.

I. Stewart, Most-perfect magic squares, Sci. Amer., Nov. 1999, pp. 122-123.

LINKS

Table of n, a(n) for n=0..8.

Index entries for sequences related to magic squares

FORMULA

Let N = 4n = Product{g}[(p_g)^(s_g)] (p_g prime) and let W_v(n) = Sum{0 <= i <= v-1}[(-1)^{v+i}BINOM(v+1, i+1)*Product{g}BINOM(s_g+i, i)] then a(n) = 2^(N-2)*(2n)!^2*Sum{0 <= v < Sum{g}s_g}[W_v(N)(W_v(N)+W_{v+1}(N))].

CROSSREFS

Sequence in context: A146204 A269561 A079234 * A254625 A165643 A165047

Adjacent sequences:  A051232 A051233 A051234 * A051236 A051237 A051238

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Formula and more terms from Floor van Lamoen, Aug 16 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 06:55 EST 2016. Contains 279043 sequences.