|
Search: id:A001431
|
|
|
| A001431 |
|
Number of graphs with n nodes and n-3 edges.
(Formerly M1382 N0540)
|
|
+0
2
|
|
| 1, 1, 2, 5, 10, 24, 63, 165, 467, 1405, 4435, 14775, 51814, 190443, 732472, 2939612, 12277230, 53233295, 239083372, 1109921554, 5316143531, 26225625392, 133050795412, 693227353094, 3704785464812
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
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
|
Cf. A008406.
Sequence in context: A032170 A084081 A106376 this_sequence A054866 A109616 A018262
Adjacent sequences: A001428 A001429 A001430 this_sequence A001432 A001433 A001434
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 12 2000
|
|
|
Search completed in 0.002 seconds
|
