login
a(n) is the number of primitive triangulations of a 5 X n rectangle.
8

%I #7 Feb 14 2022 04:02:58

%S 252,182132,182881520,208902766788,260420548144996,341816489625522032,

%T 464476385680935656240,645855159466371391947660,

%U 913036902513499041820702784,1306520849733616781789190513820,1887591165891651253904039432371172,2747848427721241461905176361078147168

%N a(n) is the number of primitive triangulations of a 5 X n rectangle.

%H S. Yu. Orevkov, <a href="https://arxiv.org/abs/2201.12827">Counting lattice triangulations: Fredholm equations in combinatorics</a>, arXiv:2201.12827 [math.CO], 2022. See Table 2, p. 6.

%Y Cf. A082640 (m X n rectangle).

%Y Cf. A351480, A351481, A351482, A351483.

%Y Cf. A351485, A351486, A351487, A351488.

%K nonn

%O 1,1

%A _Stefano Spezia_, Feb 12 2022