login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A351485
a(n) is the number of primitive triangulations of a 6 X n rectangle.
8
924, 2801708, 12244184472, 61756221742966, 341816489625522032, 1999206934751133055518, 12169409954141988707186052, 76083336332947513655554918994, 484772512167266688498399632918196, 3131521959869770128138491287826065904, 20443767611927599823217291769468449488548
OFFSET
1,1
LINKS
S. Yu. Orevkov, Counting lattice triangulations: Fredholm equations in combinatorics, arXiv:2201.12827 [math.CO], 2022. See Table 3, p. 7.
CROSSREFS
Cf. A082640 (m X n rectangle).
Sequence in context: A107517 A140906 A179715 * A362171 A177305 A177306
KEYWORD
nonn
AUTHOR
Stefano Spezia, Feb 12 2022
STATUS
approved