|
Search: id:A005974
|
|
|
| A005974 |
|
Number of unlabeled connected interval graphs with n nodes.
(Formerly M3617)
|
|
+0
1
|
|
| 1, 0, 0, 0, 0, 4, 27, 172, 1141, 8017, 60319, 486372, 4196384, 38621356, 377949874, 3920335179, 42975606304, 496545261764, 6031989895262, 76867521958187, 1025417405366410, 14292224499308110, 207763603833695113, 3144818752057400765
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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
|
Sequence in context: A034512 A015534 A061693 this_sequence A010910 A078100 A036753
Adjacent sequences: A005971 A005972 A005973 this_sequence A005975 A005976 A005977
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
a(21) onwards added by N. J. A. Sloane (njas(AT)research.att.com), Oct 19 2006 from the Robinson reference
|
|
|
Search completed in 0.002 seconds
|
