|
Search: id:A053507
|
|
|
| A053507 |
|
Binomial(n-1,2)*n^(n-3). |
|
+0
7
|
|
| 0, 0, 1, 12, 150, 2160, 36015, 688128, 14880348, 360000000, 9646149645, 283787919360, 9098660462034, 315866083233792, 11806916748046875, 472877960873902080, 20205339187128111480, 917543123840934346752, 44131536275846038655193
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Number of connected unicyclic simple graphs on n labeled nodes such that the unique cycle has length 3. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Nov 27 2001
Each simple graph (of this type) corresponds to exactly two 'functional digraphs' counted by A065513.
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Prop. 5.3.2.
|
|
FORMULA
|
E.g.f.: -1/3!*LambertW(-x)^3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 07 2001
|
|
CROSSREFS
|
Cf. A000169, A053506-A053509, A081133, A081132. Equals 2*A065513. A diagonal of A081130.
Sequence in context: A056351 A056345 A068768 this_sequence A060917 A113358 A015611
Adjacent sequences: A053504 A053505 A053506 this_sequence A053508 A053509 A053510
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 15 2000
|
|
|
Search completed in 0.002 seconds
|
