Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001866 Number of connected graphs with n nodes and n edges.
(Formerly M5170 N2245)
+0
1
0, 0, 1, 24, 936, 56640, 4968000, 598328640, 94916183040, 19200422062080, 4826695329792000, 1476585999504000000, 540272647694971699200 (list; graph; listen)
OFFSET

0,4

REFERENCES

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

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

Austin, T. L.; Fagen, R. E.; Penney, W. F.; Riordan, John; The number of components in random linear graphs. Ann. Math. Statist 30 1959 747-754.

CROSSREFS

Sequence in context: A006147 A061236 A001784 this_sequence A033590 A006175 A058810

Adjacent sequences: A001863 A001864 A001865 this_sequence A001867 A001868 A001869

KEYWORD

nonn

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research