|
Search: id:A000314
|
|
|
| A000314 |
|
Number of mixed Husimi trees with n nodes; or labeled polygonal cacti with bridges.
(Formerly M3639 N1480)
|
|
+0
12
|
|
| 1, 1, 1, 4, 31, 362, 5676, 111982, 2666392, 74433564, 2384579440, 86248530296, 3476794472064, 154579941792256, 7514932528712896, 396595845237540600
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
G. W. Ford and G. E. Uhlenbeck, Combinatorial problems in the theory of graphs III, Proc. Nat. Acad. Sci. USA, 42 (1956), 529-535.
|
|
LINKS
|
Index entries for sequences related to cacti
Index entries for sequences related to trees
|
|
FORMULA
|
A035351/n, n>0.
|
|
CROSSREFS
|
Cf. A000083, A000237, A035082, A035349-A035357.
Sequence in context: A102757 A086677 A016036 this_sequence A128709 A138860 A005046
Adjacent sequences: A000311 A000312 A000313 this_sequence A000315 A000316 A000317
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms and formula from Christian G. Bower (bowerc(AT)usa.net), Nov 15 1998
|
|
|
Search completed in 0.002 seconds
|
