|
Search: id:A033678
|
|
|
| A033678 |
|
Number of labeled Eulerian graphs with n nodes.
(Formerly M3146)
|
|
+0
3
|
|
| 1, 0, 1, 3, 38, 720, 26614, 1858122, 250586792, 66121926720, 34442540326456, 35611003057733928, 73321307277341501168, 301201690357187097528960, 2471354321681605983102370864, 40525241311304939167532163726672
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
F. Harary and E. Palmer, Graphical Enumeration, (1973), p. 12, Eq. (1.4.6).
E. M. Palmer in L. W. Beineke and R. J. Wilson, Selected Topics in Graph Theory, Academic Press, NY, 1978, p. 385ff.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..50
Huantian Cao, AutoGF: An Automated System to Calculate Coefficients of Generating Functions.
|
|
MAPLE
|
A033678 := proc(n) option remember; local k; if n=1 then 1 else 2^binomial(n-1, 2)-(1/n)*add(k*binomial(n, k)*2^binomial(n-k-1, 2)*A033678(k), k=1..n-1); fi; end;
|
|
MATHEMATICA
|
Normal[ Series[ Log[ 1 + Sum[ 2^( (p-1)(p-2)/2 )x^p/(p!), {p, 1, n} ] ], {x, 0, n} ] ] (* truncated exponential generating function *)
|
|
CROSSREFS
|
Sequence in context: A050394 A138562 A005780 this_sequence A072331 A109518 A062155
Adjacent sequences: A033675 A033676 A033677 this_sequence A033679 A033680 A033681
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
njas, Geoffrey Mess (mess(AT)math.ucla.edu)
|
|
|
Search completed in 0.002 seconds
|
