|
Search: id:A048180
|
|
|
| A048180 |
|
Number of graphs with n nodes and n+2 edges. |
|
+0
4
|
|
| 1, 4, 24, 131, 663, 3252, 15772, 75415, 359307, 1711908, 8191607, 39500169, 192525021, 950868860, 4769060224, 24331970791, 126457607026
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
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 1967J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
|
|
CROSSREFS
|
Cf. A008406.
Sequence in context: A098224 A024049 A103455 this_sequence A057391 A071079 A153337
Adjacent sequences: A048177 A048178 A048179 this_sequence A048181 A048182 A048183
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 03 2000
|
|
|
Search completed in 0.002 seconds
|
