login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121063 Number of labeled directed multigraphs with n arcs for which every vertex has in-degree at least one and out-degree at least one. 1
1, 0, 1, 4, 27, 246, 2783, 37424, 582153, 10276452, 202894801, 4429522252, 105943672079, 2754788353526, 77371821493913, 2334279549290960, 75286455363538607, 2584971423426768872, 94138234184851584599, 3624294240897948371036, 147080227272202880297669 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 0..60

FORMULA

G.f.: A(x/(1-x)) where A(x) is g.f. for A121933.

MAPLE

n:=20: t:=taylor(sum(sum((-1)^(s-k)*binomial(s, k)*((1+x/(1-x))^(k-1)-1)^k*((1+x/(1-x))^k-1)^(s-k), k=0..s), s=0..n), x, n+1): seq(coeff(t, x, s), s=0..n); # Nathaniel Johnston, Apr 28 2011

CROSSREFS

Cf. A052170, A056078, A104209, A121933.

Sequence in context: A161120 A183430 A212559 * A051863 A000699 A138423

Adjacent sequences:  A121060 A121061 A121062 * A121064 A121065 A121066

KEYWORD

easy,nonn,changed

AUTHOR

Vladeta Jovovic, Sep 06 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 18 23:01 EDT 2013. Contains 225428 sequences.