|
%I #7 Mar 13 2021 20:23:35
%S 1,1,4,15,64,293,1414,7102,36809,195676,1062176,5867676,32901124,
%T 186866589,1073261418,6225028476,36420849235,214744648169,
%U 1275005642668,7617704400227,45772485843616,276460659973100,1677717692649544,10225697003966360,62575895785795084
%N Number of simple 3-connected triangulations of a disk with n nodes.
%C A triangulation is simple if it contains no separating 3-cycle.
%H Andrew Howroyd, <a href="/A341922/b341922.txt">Table of n, a(n) for n = 4..200</a>
%e The a(5) = 1 triangulation is:
%e o-------o
%e | \ / |
%e | o |
%e | / \ |
%e o-------o
%o (PARI) \\ R(n,m) defined in A210664.
%o seq(n)={my(v=R(n,0)); for(m=1, n-1, v+=concat(vector(m), R(n-m,m))); v}
%Y Antidiagonal sums of A210664.
%K nonn
%O 4,3
%A _Andrew Howroyd_, Feb 24 2021
|
