|
Search: id:A001434
|
|
|
| A001434 |
|
Number of graphs with n nodes and n edges.
(Formerly M1653 N0647)
|
|
+0
4
|
|
| 1, 2, 6, 21, 65, 221, 771, 2769, 10250, 39243, 154658, 628635, 2632420, 11353457, 50411413, 230341716, 1082481189, 5228952960, 25945377057, 132140242356, 690238318754, 3694876952577
(list; graph; listen)
|
|
|
OFFSET
|
3,2
|
|
|
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).
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: A004192 A104143 A088812 this_sequence A119098 A116842 A116774
Adjacent sequences: A001431 A001432 A001433 this_sequence A001435 A001436 A001437
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 07 2000
|
|
|
Search completed in 0.002 seconds
|
