|
Search: id:A049336
|
|
|
| A049336 |
|
Triangle T(n,k) = number of 2-connected planar graphs with n >= 1 nodes and 0<=k<=3n-6 edges. |
|
+0
3
|
|
| 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 2, 3, 2, 1, 0, 0, 0, 0, 0, 0, 1, 3, 9, 13, 11, 5, 2, 0, 0, 0, 0, 0, 0, 0, 1, 4, 20, 49, 77, 75, 47, 16, 5, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 40, 158, 406, 662, 737, 538, 259, 72, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 7, 70, 426, 1645, 4176
(list; graph; listen)
|
|
|
OFFSET
|
1,21
|
|
|
REFERENCES
|
A. Gagarin, G. Labelle, P. Leroux and T. Walsh, Structure and enumeration of two-connected graphs with prescribed three-connected components, Advances in Applied Mathematics (2009) to appear. [From Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009]
|
|
EXAMPLE
|
0; 0,0; 0,0,0,1; 0,0,0,0,1,1,1; 0,0,0,0,0,1,2,3,2,1; 0,0,0,0,0,0,1,3,9...
|
|
CROSSREFS
|
Cf. A021103, A003094, A049334.
Sequence in context: A105855 A152954 A079175 this_sequence A017888 A017878 A017868
Adjacent sequences: A049333 A049334 A049335 this_sequence A049337 A049338 A049339
|
|
KEYWORD
|
nonn,tabf,easy,nice
|
|
AUTHOR
|
Brendan McKay (bdm(AT)cs.anu.edu.au)
|
|
EXTENSIONS
|
More terms, a(86) onwards, from Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009
|
|
|
Search completed in 0.005 seconds
|
