|
%I #32 Jul 30 2024 02:55:39
%S 1,1,2,3,4,6,7,8,10,12,13,16,16,18,20,23,24,26,26,30,32,35,34,38,38,
%T 42,44,46,47,54,52,54,52,56,60,66,67,68,66,72,72,80,74,82,84,87,86,90,
%U 88,96,96,102,96,104,104,115,114,116,110,118,114,124,122,126,134,140,135,134,132,146,144,156,144,150,152,158
%N a(n) is the number of plane corner cuts of size n.
%C In Bergeron and Mazin, a(n) is the number of triangular partitions of size n.
%H Alejandro B. Galván, <a href="/A352882/b352882.txt">Table of n, a(n) for n = 0..10000</a>
%H François Bergeron and Mikhail Mazin, <a href="https://arxiv.org/abs/2203.15942">Combinatorics of Triangular Partitions</a>, arXiv:2203.15942 [math.CO], (2022). See p. 2.
%H Sylvie Corteel, Gäel Rémond, Gilles Schaeffer, and Hugh Thomas, <a href="https://doi.org/10.1006/aama.1999.0646">The Number of Plane Corner Cuts</a>, Adv. in Appl. Math. 23, no. 1, (1999).
%H Sergi Elizalde and Alejandro B. Galván, <a href="https://arxiv.org/abs/2312.16353">Triangular partitions: enumeration, structure, and generation</a>, arXiv:2312.16353 [math.CO], (2023).
%H Sergi Elizalde and Alejandro B. Galván, <a href="https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2024/68.pdf">Combinatorial properties of triangular partitions</a>, Proceedings of the 36th Conference on Formal Power Series and Algebraic Combinatorics (Bochum), Séminaire Lotharingien de Combinatoire 91B (2024) Article #68, 12 pp.
%H Alejandro B. Galván, <a href="/A352882/a352882_1.txt">C++ program</a>.
%F See the g.f. at page 2 in Corteel et al.
%Y Cf. A007294, A275518.
%K nonn,changed
%O 0,3
%A _Stefano Spezia_, Apr 07 2022
%E More terms from _Alejandro B. Galván_, Dec 29 2023
|
