|
Search: id:A048179
|
|
|
| A048179 |
|
Number of graphs with n nodes and n+1 edges. |
|
+0
4
|
|
| 1, 6, 24, 97, 402, 1637, 6759, 28259, 119890, 517121, 2271860, 10176660, 46541024, 217511951, 1039651295, 5084972068, 25458149446, 130480742790, 684550272269, 3675258986639
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
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 1967J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p . 146
|
|
CROSSREFS
|
Cf. A008406.
Sequence in context: A002023 A164908 A037505 this_sequence A117614 A037688 A126393
Adjacent sequences: A048176 A048177 A048178 this_sequence A048180 A048181 A048182
|
|
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
|
