OFFSET
0,2
REFERENCES
R. A. Brualdi, H. J. Ryser, Combinatorial Matrix Theory, Cambridge Univ. Press, 1992.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..30
Peter L. Erdos, I Miklós, Z Toroczkai, New classes of degree sequences with fast mixing swap Markov chain sampling, arXiv preprint arXiv:1601.08224 [math.CO], 2016.
FORMULA
Calculated using Cor. 6.3.3, Th. 6.3.6, Cor. 6.2.5 of Brualdi-Ryser.
a(n) = F(n, n, 0, n) where F(b, c, t, w) = Sum_{i=0..b} Sum_{j=ceiling((t+i)/w))..min(t+i, c)} F(i, j, t+i-j, w-1) for w > 0, F(b, c, 0, 0) = 1 and F(b, c, t, 0) = 0 for t > 0. - Andrew Howroyd, Nov 01 2019
PROG
(PARI) \\ see A327913 for T(n, m)
for(n=0, 15, print1(T(n, n), ", ")) \\ Andrew Howroyd, Nov 01 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
torsten.sillke(AT)lhsystems.com
EXTENSIONS
"Loops allowed" added to the definition by Brendan McKay, Oct 20 2015
a(0)=1 prepended and terms a(12) and beyond from Andrew Howroyd, Oct 31 2019
STATUS
approved