login
A351488
a(n) is the number of primitive triangulations of a 9 X n rectangle.
8
48620, 11224598424, 4140106747178292, 1835933384812941453312, 913036902513499041820702784, 484772512167266688498399632918196, 269621109753732518252493257828413137272, 155023302820254133629368881178138076738462112, 91376512409462235694151119897052344522006298310908
OFFSET
1,1
LINKS
S. Yu. Orevkov, Counting lattice triangulations: Fredholm equations in combinatorics, arXiv:2201.12827 [math.CO], 2022. See Table 6, p. 8.
CROSSREFS
Cf. A082640 (m X n rectangle).
Sequence in context: A245862 A177313 A140924 * A177314 A177315 A172613
KEYWORD
nonn
AUTHOR
Stefano Spezia, Feb 12 2022
STATUS
approved