OFFSET
0,32
COMMENTS
T(m,n) is conjectured to be the crossing number of the complete bipartite graph K_{m,n}.
LINKS
D. McQuillan and R. B. Richter, A parity theorem for drawings of complete and bipartite graphs, Amer. Math. Monthly, 117 (2010), 267-273.
FORMULA
EXAMPLE
Array begins:
0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 0, 0, 0, 0, 0, 0, ...
0, 0, 0, 1, 2, 4, 6, 9, 12, ...
0, 0, 0, 2, 4, 8, 12, 18, 24, ...
0, 0, 0, 4, 8, 16, 24, 36, 48, ...
0, 0, 0, 6, 12, 24, 36, 54, 72, ...
0, 0, 0, 9, 18, 36, 54, 81, 108, ...
0, 0, 0, 12, 24, 48, 72, 108, 144, ...
MAPLE
K:=(m, n)->floor(m/2)*floor((m-1)/2)*floor(n/2)*floor((n-1)/2);
PROG
(PARI) T(n, k) = ((n-1)^2\4)*((k-1)^2\4);
tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n, k), ", ")); print()); \\ Michel Marcus, Sep 30 2017
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Jun 19 2011
STATUS
approved