login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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; text; internal format)
OFFSET

1,2

REFERENCES

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

Phil Hanlon, Counting interval graphs, Trans. Amer. Math. Soc. 272 (1982), no. 2, 383-426.

CROSSREFS

Sequence in context: A208356 A188489 A085657 * A058862 A191482 A140722

Adjacent sequences:  A005212 A005213 A005214 * A005216 A005217 A005218

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 08:27 EDT 2021. Contains 348067 sequences. (Running on oeis4.)