A341922 Number of simple 3-connected triangulations of a disk with n nodes.

1, 1, 4, 15, 64, 293, 1414, 7102, 36809, 195676, 1062176, 5867676, 32901124, 186866589, 1073261418, 6225028476, 36420849235, 214744648169, 1275005642668, 7617704400227, 45772485843616, 276460659973100, 1677717692649544, 10225697003966360, 62575895785795084

Offset: 4

Author

Andrew Howroyd, Feb 24 2021

Keywords

• nonn

Comments

A triangulation is simple if it contains no separating 3-cycle.

Examples

			The a(5) = 1 triangulation is:
      o-------o
      | \   / |
      |   o   |
      | /   \ |
      o-------o
		

Links

• Andrew Howroyd, Table of n, a(n) for n = 4..200

Crossrefs

Antidiagonal sums of A210664.

Programs

PARI

\\ R(n,m) defined in A210664.
seq(n)={my(v=R(n,0)); for(m=1, n-1, v+=concat(vector(m), R(n-m,m))); v}