|
| |
|
|
A005976
|
|
Number of unlabeled connected interval graphs with n nodes.
(Formerly M1487)
|
|
1
| |
|
|
1, 1, 2, 5, 15, 56, 250, 1328, 8069, 54962, 410330, 3317302, 28774874, 266242936, 2616100423, 27205605275, 298569256590, 3449309394415, 41854968275924, 532353636671777, 7083840662453415, 98443312509634266, 1426382369328881332
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| P. J. Hanlon, Counting interval graphs. Trans. Amer. Math. Soc. 272 (1982), no. 2, 383-426.
P. J. Hanlon, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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: A137533 A121392 A119611 * A187981 A048192 A078792
Adjacent sequences: A005973 A005974 A005975 * A005977 A005978 A005979
|
|
|
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
|
| |
|
|
