|
Search: id:A049340
|
|
|
| A049340 |
|
Triangle T(n,k) = number of planar graphs with n >= 1 nodes and 0<=k<=C(n,2) edges, all degrees even. |
|
+0
2
|
|
| 1, 1, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 0, 0, 3, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 6, 1, 0, 0, 1, 1, 1, 3, 2, 2, 1, 1, 1, 0, 0, 0, 14, 1, 0, 0, 1, 1, 1, 3, 4, 4, 6, 5, 5, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 36, 1, 1, 1, 1, 3, 4, 7, 9, 15, 17, 22, 14, 16, 5, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
EXAMPLE
|
1; 1,1; 0,1,1,0; 0,1,2,1,0,0,1; 1,0,0,3,1,0,0,1,1,1; 1,1,0,0,0,6,1,0,0...
|
|
CROSSREFS
|
Cf. A049339, A000944, A021103, A003094, A049334.
Adjacent sequences: A049337 A049338 A049339 this_sequence A049341 A049342 A049343
Sequence in context: A083025 A046080 A035227 this_sequence A056929 A151692 A115201
|
|
KEYWORD
|
nonn,tabf,easy,nice
|
|
AUTHOR
|
Brendan McKay (bdm(AT)cs.anu.edu.au)
|
|
|
Search completed in 0.002 seconds
|
