Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000681
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000681 Number of n X n matrices with nonnegative entries and every row and column sum 2.
(Formerly M3084 N1250)
+0
9
1, 1, 3, 21, 282, 6210, 202410, 9135630, 545007960, 41514583320, 3930730108200, 452785322266200, 62347376347779600, 10112899541133589200, 1908371363842760216400, 414517594539154672566000, 102681435747106627787376000, 28772944645196614863048048000 (list; graph; listen)
OFFSET

0,3

COMMENT

Or, number of labeled 2-regular pseudodigraphs (multiple arcs and loops allowed) of order n.

REFERENCES

H. Anand, V. C. Dumir and H. Gupta, A combinatorial distribution problem, Duke Math. J., 33 (1996), 757-769.

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 125, #25, a_n.

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, John Wiley and Sons, N.Y., 1983, section 3.5.10.

William George Griffiths, "On Integer Solutions to Linear Equations", Annals of Combinatorics 12:1 (2008), pp. 53-70. [From Charles R Greathouse IV Apr 03 2009]

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1982.

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, Cambridge, Vol. 2, 1999; see Cor. 5.5.11 (a).

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.

C. B. Tompkins, Methods of successive restrictions in computational problems involving discrete variables. 1963, Proc. Sympos. Appl. Math., Vol. XV pp. 95-106; Amer. Math. Soc., Providence, R.I.

Zhonghua,Tan and Shanzhen Gao, Counting (0,1,2)-Matrices, submitted.

LINKS

R. W. Robinson, Table of n, a(n) for n = 0..48

Ira Gessel, Enumerative applications of symmetric functions

Index entries for sequences related to magic squares

FORMULA

Sum_{n >= 0} a(n) x^n / n!^2 = 1/(1-x)^(1/2)*exp(1/2*x).

a(n) = n^2*a(n-1) - (1/2)*n*(n-1)^2*a(n-2).

a(n) is asymptotic to c/sqrt(n)*(n!)^2 where c=0.93019... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 25 2004

Sum[i=0..n, 2^(i-2n) * C(n, i)^2 * (2n-2i)! * i! ].

a(n)=2^{-n} sum_{i=0}^{n}\frac{(n!)^{2}(2i)!}{(i!)^{2}((n-i)!2^{i})} - Shanzhen Gao (sgao2(AT)fau.edu), Nov 05 2007

CROSSREFS

Cf. A001499, A005650, A123544.

Sequence in context: A066206 A130032 A126461 this_sequence A055555 A158888 A005329

Adjacent sequences: A000678 A000679 A000680 this_sequence A000682 A000683 A000684

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 20:25 EST 2009. Contains 170428 sequences.


AT&T Labs Research