|
Search: id:A005973
|
|
|
| A005973 |
|
Number of connected labeled interval graphs with n nodes.
(Formerly M3658)
|
|
+0
1
|
|
| 1, 1, 4, 35, 541, 13062, 444767, 19912657, 1121041222, 77048430033, 6329916102841, 611728117464928, 68657066350744197, 8854866422322096893, 1300613343254300891316
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Hanlon, Phil; Counting interval graphs. Trans. Amer. Math. Soc. 272 (1982), no. 2, 383-426.
P. J. Hanlon, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..30
|
|
CROSSREFS
|
Adjacent sequences: A005970 A005971 A005972 this_sequence A005974 A005975 A005976
Sequence in context: A132694 A143669 A119391 this_sequence A007134 A125798 A129581
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
