Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001437 Number of connected graphs with n nodes and ceiling(n(n-1)/4) edges.
(Formerly M1538 N0601)
+0
3
1, 1, 2, 5, 22, 138, 1579, 33366, 1348674, 105925685, 15968704512, 4520384306832, 2402814904220039, 2425664021535713098 (list; graph; listen)
OFFSET

2,3

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).

M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected Linear Graphs up to $p = 18$ Points. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967.

CROSSREFS

Largest entries in the rows of the table in A054924.

Sequence in context: A066305 A020093 A111542 this_sequence A067549 A042933 A005203

Adjacent sequences: A001434 A001435 A001436 this_sequence A001438 A001439 A001440

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research