|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 236, P(n,3).
Shanzhen Gao, Sequences Arising from Integer Matrix Enumeration (in preparation) [From shanzhen gao (shanzhengao(AT)yahoo.com), Feb 19 2010]
R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Wadsworth, Vol. 1, 1986; see Example 1.1.3, page 2, f(n).
M. L. Stein and P. R. Stein, Enumeration of Stochastic Matrices with Integer Elements. Report LA-4434, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Jun 1970.
Wang, Bo-Ying; Zhang, Fuzhen. On the precise number of (0,1)-matrices in A(R,S). Discrete Math. 187 (1998), no. 1-3, 211--220. MR1630720 (99f:05010). - From N. J. A. Sloane, Jun 07 2012
|
|
|
PROG
|
(PARI) a(n)=local(k); if(n<0, 0, n!^2*sum(j=0, n, sum(i=0, n-j, if(1, k=n-i-j; (j+3*k)!/(3^i*36^k*i!*k!^2)))/j!/(-2)^j)) (from Michael Somos)
|