The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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) 14

%I M1191 N0461

%S 1,1,1,2,4,9,23,63,188,596,1979,6804,24118,87379,322652,1209808,

%T 4596158,17657037,68497898,268006183,1056597059,4193905901,

%U 16748682185,67258011248,271452424286,1100632738565,4481533246014

%N Number of mixed Husimi trees with n nodes; or polygonal cacti with bridges.

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

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

%H Christian G. Bower, <a href="/A000083/b000083.txt">Table of n, a(n) for n = 0..500</a>

%H G. W. Ford and G. E. Uhlenbeck, <a href="http://www.jstor.org/stable/89494">Combinatorial problems in the theory of graphs III</a>, Proc. Nat. Acad. Sci. USA, 42 (1956), 529-535.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CactusGraph.html">Cactus Graph</a>

%H <a href="/index/Ca#cacti">Index entries for sequences related to cacti</a>

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

%F G.f.: A(x) = B(x) + C(x) - B(x)*D(x), where B, C, D respectively are g.f.s of A000237, A035349, A035350. - _Christian G. Bower_, Nov 15 1998

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

%K nonn

%O 0,4

%A _N. J. A. Sloane_

%E More terms from _Christian G. Bower_, Nov 15 1998

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 13 12:29 EDT 2021. Contains 342936 sequences. (Running on oeis4.)