login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005215 Number of labeled interval graphs with n nodes.
(Formerly M1893)
1
1, 2, 8, 61, 822, 17914, 571475, 24566756, 1346167320, 90729050427, 7341861588316, 700870085606926, 77858914606919461, 9954018225212149326, 1450980922023874162612 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..30

CROSSREFS

Sequence in context: A188324 A188489 A085657 * A058862 A191482 A140722

Adjacent sequences:  A005212 A005213 A005214 * A005216 A005217 A005218

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:49 EST 2012. Contains 205824 sequences.