login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET
1,3
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
Phil Hanlon, Counting interval graphs, Trans. Amer. Math. Soc. 272 (1982), no. 2, 383-426.
CROSSREFS
Sequence in context: A137533 A121392 A216388 * A351158 A187981 A334155
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
a(21) onwards added by N. J. A. Sloane, Oct 19 2006 from the Robinson reference
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 23:44 EDT 2024. Contains 373715 sequences. (Running on oeis4.)