|
Search: id:A100960
|
|
|
| A100960 |
|
Triangle read by rows: T(n,k) = number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(k-2). |
|
+0
2
|
|
| 1, 3, 6, 1, 12, 70, 100, 45, 10, 60, 720, 2445, 3525, 2637, 1125, 195
(list; graph; listen)
|
|
|
OFFSET
|
3,2
|
|
|
REFERENCES
|
E. A. Bender, Z. Gao and N. C. Wormald, The number of labeled 2-connected planar graphs, Electron. J. Combin., 9 (2002), #R43.
|
|
EXAMPLE
|
The triangle T(n,k), n>=3, k>=3 begins:
1
0 3 6 1
0 0 12 70 100 45 10
0 0 0 60 720 2445 3525 2637 1125 195
|
|
CROSSREFS
|
Row sums give A096331. Main diagonal is A001170.
Sequence in context: A130724 A120229 A123534 this_sequence A130852 A138799 A108441
Adjacent sequences: A100957 A100958 A100959 this_sequence A100961 A100962 A100963
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2005
|
|
EXTENSIONS
|
The Bender et al. paper (on the web) gives many more terms.
|
|
|
Search completed in 0.002 seconds
|
