Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007134
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007134 Number of connected labeled chordal graphs (or triangulated graphs) with n nodes.
(Formerly M3659)
+0
5
1, 1, 4, 35, 541, 13302, 489287, 25864897, 1910753782, 193328835393, 26404671468121, 4818917841228328, 1167442027829857677 (list; graph; listen)
OFFSET

1,3

REFERENCES

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

N. C. Wormald, Counting labeled chordal graphs. Graphs Combin. 1 (1985), no. 2, 193-200.

CROSSREFS

Cf. A058862.

Sequence in context: A119391 A165933 A005973 this_sequence A125798 A129581 A120055

Adjacent sequences: A007131 A007132 A007133 this_sequence A007135 A007136 A007137

KEYWORD

nonn,nice

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research