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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000083 Number of mixed Husimi trees with n nodes; or polygonal cacti with bridges.
(Formerly M1191 N0461)
12
1, 1, 1, 2, 4, 9, 23, 63, 188, 596, 1979, 6804, 24118, 87379, 322652, 1209808, 4596158, 17657037, 68497898, 268006183, 1056597059, 4193905901, 16748682185, 67258011248, 271452424286, 1100632738565, 4481533246014 (list; graph; refs; listen; history; internal format)
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.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

LINKS

Christian G. Bower, Table of n, a(n) for n=0..500

Index entries for sequences related to cacti

Index entries for sequences related to trees

FORMULA

G.f.: A(x)=B(x)+C(x)-B(x)*D(x), B, C, D resp gfs of A000237, A035349, A035350.

CROSSREFS

Cf. A000237, A000314, A035082, A035349-A035357.

Sequence in context: A058585 A001573 A135307 * A092668 A164039 A014137

Adjacent sequences:  A000080 A000081 A000082 * A000084 A000085 A000086

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms and formula from Christian G. Bower (bowerc(AT)usa.net), Nov 15 1998

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 February 12 15:30 EST 2012. Contains 205429 sequences.