|
|
A343873
|
|
Triangle read by rows: T(n,k) is the number of unlabeled connected planar graphs with n edges and k nodes (n >= 0, 1 <= k <= n + 1).
|
|
3
|
|
|
1, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 2, 3, 0, 0, 0, 1, 5, 6, 0, 0, 0, 1, 5, 13, 11, 0, 0, 0, 0, 4, 19, 33, 23, 0, 0, 0, 0, 2, 22, 67, 89, 47, 0, 0, 0, 0, 1, 19, 107, 236, 240, 106, 0, 0, 0, 0, 0, 13, 130, 486, 797, 657, 235, 0, 0, 0, 0, 0, 5, 130, 804, 2075, 2678, 1806, 551
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,10
|
|
COMMENTS
|
First differs from A054923 in row n=9.
Terms may be computed using the tools geng and planarg in nauty.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins (n edges >= 0, k vertices >= 1):
1;
0, 1;
0, 0, 1;
0, 0, 1, 2;
0, 0, 0, 2, 3;
0, 0, 0, 1, 5, 6;
0, 0, 0, 1, 5, 13, 11;
0, 0, 0, 0, 4, 19, 33, 23;
0, 0, 0, 0, 2, 22, 67, 89, 47;
0, 0, 0, 0, 1, 19, 107, 236, 240, 106;
0, 0, 0, 0, 0, 13, 130, 486, 797, 657, 235;
...
|
|
PROG
|
(nauty) geng -c $k $n:$n | planarg -q | countg -q # Georg Grasegger, Jul 06 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|