Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035087
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035087 Number of labeled rooted polygonal cacti (Husimi graphs) with n nodes. +0
2
1, 0, 3, 12, 135, 1440, 20895, 342720, 6585705, 142430400, 3449279295, 92207808000, 2699909867655, 85900402748160, 2951318065570875, 108894519775641600, 4294542443185019025 (list; graph; listen)
OFFSET

1,3

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 301.

Harary and E. M. Palmer, Graphical Enumeration, p. 71

F. Harary and R. Z. Norman "The Dissimilarity Characteristic of Husimi Trees" Annals of Mathematics, 58 1953, pp. 134-141

F. Harary and G. E. Uhlenbeck "On the Number of Husimi Trees" Proc. Nat. Acad. Sci. USA vol. 39 pp. 315-322 1953

LINKS

Index entries for sequences related to cacti

Index entries for sequences related to rooted trees

FORMULA

E.g.f. satisfies A(x)=x*exp(A(x)^2/(2-2*A(x))).

MAPLE

A:= proc(n) option remember; if n<=1 then x else convert (series (x* exp (A(n-1)^2/ (2-2*A(n-1))), x=0, n+1), polynom) fi end: a:= n-> coeff (A(n), x, n)*n!: seq (a(n), n=1..17); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 22 2008]

CROSSREFS

Cf. A035082-A035088.

Sequence in context: A073987 A138392 A152544 this_sequence A056426 A056417 A098152

Adjacent sequences: A035084 A035085 A035086 this_sequence A035088 A035089 A035090

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Nov 15 1998

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research