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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005973 Number of connected labeled interval graphs with n nodes.
(Formerly M3658)
1
1, 1, 4, 35, 541, 13062, 444767, 19912657, 1121041222, 77048430033, 6329916102841, 611728117464928, 68657066350744197, 8854866422322096893, 1300613343254300891316 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

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: A119391 A177387 A165933 * A007134 A125798 A129581

Adjacent sequences:  A005970 A005971 A005972 * A005974 A005975 A005976

KEYWORD

nonn,nice

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 17 12:38 EST 2012. Contains 206021 sequences.