|
Search: id:A005216
|
|
|
| A005216 |
|
Number of unlabeled identity interval graphs with n nodes.
(Formerly M3636)
|
|
+0
1
|
|
| 1, 0, 0, 0, 0, 4, 31, 199, 1313, 9158, 68336, 546697, 4682870, 42818887, 416581477, 4298371842, 46896673051, 539527125454, 6528590200432, 82900013695783, 1102289694637302, 15317689255215159, 222056321177147564, 3352587738814695770
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
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: A005213 A005214 A005215 this_sequence A005217 A005218 A005219
Sequence in context: A070522 A087689 A059938 this_sequence A014537 A136284 A039765
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(21) on added by njas, Oct 19 2006 from the Robinson reference.
|
|
|
Search completed in 0.002 seconds
|
