|
|
|
|
#14 by R. J. Mathar at Mon Nov 23 09:28:39 EST 2020
|
|
|
|
#13 by R. J. Mathar at Mon Nov 23 09:28:34 EST 2020
|
| LINKS
|
G. Xin, <a href="https://doi.org/10.1016/j.jcta.2014.11.006">A Euclid style algorithm for MacMahon's partition analysis</a>, J. Comb. Theory A 131 (2015) 32 sect. 5.3
|
| STATUS
|
approved
editing
|
|
|
|
#12 by Susanna Cuyler at Sat Apr 18 00:02:43 EDT 2020
|
|
|
|
#11 by Georg Fischer at Fri Apr 17 18:04:46 EDT 2020
|
|
|
|
#10 by Georg Fischer at Fri Apr 17 17:09:12 EDT 2020
|
| LINKS
|
G. Guoce Xin, <a href="http://arxiv.org/abs/1208.6074">A Euclid style algorithm for MacMahon's partition analysis</a>, arxiv 1208.6074
|
| FORMULA
|
+493826644119635*x127x^127+2591895971809073*x^126+12239625173465375*x^125+52618101897021930*x^124
+36140317*x^4+1002806*x^3+15057*x^2+99*x+1)*(x-1)^3/((x^4-1)^5*(x^8-1)^2*(x^3-1)^5*(x^9-1)*(x^5-1)^4*(x^6-1)^6*(x^7-1)^3*(x^10-1))) [typos corrected by _Georg Fischer_, Apr 17 2020]
|
| STATUS
|
approved
editing
|
|
|
Discussion
|
Fri Apr 17
| 18:04
| Georg Fischer: The g.f. reproduces the terms.
|
|
|
|
#9 by T. D. Noe at Fri Aug 31 12:50:21 EDT 2012
|
|
|
|
#8 by T. D. Noe at Fri Aug 31 12:50:17 EDT 2012
|
| LINKS
|
G. Xin, <a href="http://arxiv.org/abs/1208.6074">A Euclid style algorithm for MacMahon partition analysis</a> >, arxiv 1208.6074
|
| STATUS
|
approved
editing
|
|
|
|
#7 by T. D. Noe at Fri Aug 31 12:49:42 EDT 2012
|
|
|
|
#6 by T. D. Noe at Fri Aug 31 12:49:35 EDT 2012
|
| NAME
|
Number of 6 by 6 magic squares with line sum n.
|
| REFERENCES
|
G. Xin, A Euclid style algorithm for MacMahon partition analysis, arxiv.org/abs/1208.6074
|
| LINKS
|
G. Xin <, <a href="http://arxiv.org/abs/1208.6074">A Euclid style algorithm for MacMahon partition analysis</a> arxiv 1208.6074
|
| EXAMPLE
|
For n = 1, there are a(1)=) = 96 order 6 permutation matrices with exactly one 1 in each of the two diagonals.
|
| CROSSREFS
|
Cf. A111158.
|
| STATUS
|
proposed
editing
|
|
|
|
#5 by Guoce Xin at Thu Aug 30 23:25:01 EDT 2012
|
|
|
|