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).
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
Offset: 0
Examples
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; ...
Links
- Georg Grasegger, Table of n, a(n) for n = 0..285 (rows 0..22) (terms 0..209 (rows 0..19) from Andrew Howroyd)
- Brendan McKay and Adolfo Piperno, nauty and Traces
Crossrefs
Programs
-
nauty
geng -c $k $n:$n | planarg -q | countg -q # Georg Grasegger, Jul 06 2023
Comments