|
Search: id:A000717
|
|
|
| A000717 |
|
Number of graphs with n nodes and [ n(n-1)/4 ] edges.
(Formerly M2599 N1027)
|
|
+0
3
|
|
| 1, 1, 1, 3, 6, 24, 148, 1646, 34040, 1358852, 106321628, 16006173014, 4525920859198, 2404130854745735, 2426376196165902704
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
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.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
|
|
CROSSREFS
|
Cf. A008406.
Sequence in context: A054718 A109155 A081072 this_sequence A076020 A018964 A018994
Adjacent sequences: A000714 A000715 A000716 this_sequence A000718 A000719 A000720
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
