|
|
A001432
|
|
Number of graphs with n nodes and n-4 edges.
(Formerly M1397 N0544)
|
|
2
|
|
|
0, 0, 0, 1, 1, 2, 5, 11, 25, 66, 172, 485, 1446, 4541, 15036, 52496, 192218, 737248, 2952621, 12313532, 53336122, 239380403, 1110793092, 5318743428, 26233496486, 133074975399
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MATHEMATICA
|
(* first do *) Needs["Combinatorica`"] (* then *) Table[ NumberOfGraphs[n, n-4], {n, 4, 26}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|