|
Search: id:A004300
|
|
|
| A004300 |
|
Number of symmetric irreducible diagrams with 2n nodes.
(Formerly M1758)
|
|
+0
3
|
|
| 1, 1, 2, 7, 22, 96, 380, 1853, 8510, 44940, 229836, 1296410, 7211116, 43096912, 256874200, 1617413773, 10226972110, 67542201972, 449809389740, 3104409032126
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
M. Klazar, Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings, Advances in Appl. Math., Vol. 30 (2003), pp. 126-136.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. R. Stein, On a class of linked diagrams, I. Enumeration, J. Combin. Theory, A 24 (1978), 357-366.
R. R. Stein and C. J. Everett, On a class of linked diagrams, II. Asymptotics, Discrete Math., 21 (1978), 309-318.
|
|
CROSSREFS
|
Cf. A000699.
Sequence in context: A150332 A150333 A057787 this_sequence A049369 A153523 A153551
Adjacent sequences: A004297 A004298 A004299 this_sequence A004301 A004302 A004303
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
