login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007081 Number of labeled Eulerian oriented graphs with n nodes.
(Formerly M3009)
3

%I M3009 #20 Oct 08 2017 18:48:45

%S 1,1,3,15,219,7839,777069,208836207,156458382975,328208016021561,

%T 1946879656265710431,32834193098697741359313,

%U 1582809785794578499063205301,218989607557709869788340418432175,87269441106898007902526099850864517077

%N Number of labeled Eulerian oriented graphs with n nodes.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H B. D. McKay, <a href="http://cs.anu.edu.au/~bdm/papers/LabelledEnumeration.pdf">Applications of a technique for labeled enumeration</a>, Congress. Numerantium, 40 (1983), 207-221.

%H B. D. McKay, <a href="http://users.cecs.anu.edu.au/~bdm/papers/rt.pdf">The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs</a>, Combinatorica 10 (1990), 367-377.

%F a(n) = coefficient of [x_1*x_2*...*x_n]^(n-1) in Product_{1<=i<j<=n} (x_i^2 + x_j^2 + x_i*x_j). - _Sean A. Irvine_, Oct 08 2017

%K nonn,nice

%O 1,3

%A _N. J. A. Sloane_, _Mira Bernstein_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)