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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005978 Number of dependable interval graphs with n nodes.
(Formerly M3554)
0
0, 0, 0, 0, 1, 4, 19, 93, 539, 3474, 24856, 192972, 1613219, 14410374, 136920388, 1378542639, 14663082556, 164340455701, 1936286904952, 23932267735948, 309701296575063 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

REFERENCES

P. J. Hanlon, personal communication.

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

LINKS

Table of n, a(n) for n=1..21.

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

CROSSREFS

Sequence in context: A275751 A131552 A122369 * A083065 A137636 A027618

Adjacent sequences:  A005975 A005976 A005977 * A005979 A005980 A005981

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 December 14 08:07 EST 2018. Contains 318090 sequences. (Running on oeis4.)