A369929 -id:A369929 - cp's OEIS frontend

A047749 If n = 2m then a(n) = binomial(3m, m)/(2m+1), if n=2m+1 then a(n) = binomial(3m+1, m+1)/(2m+1).

1, 1, 1, 2, 3, 7, 12, 30, 55, 143, 273, 728, 1428, 3876, 7752, 21318, 43263, 120175, 246675, 690690, 1430715, 4032015, 8414640, 23841480, 50067108, 142498692, 300830572, 859515920, 1822766520, 5225264024, 11124755664, 31983672534, 68328754959, 196947587823, 422030545335

Offset: 0

N. J. A. Sloane

nonn

Hankel transform appears to be a signed aerated version of A059492. - Paul Barry, Apr 16 2008
Row sums of inverse Riordan array (1, x*(1-x^2))^(-1). - Paul Barry, Apr 16 2008
a(n) is the number of permutations of length n avoiding 213 in the classical sense which are breadth-first search reading words of increasing unary-binary trees. For more details, see the entry for permutations avoiding 231 at A245898. - Manda Riehl, Aug 05 2014
From David Callan, Aug 22 2014: (Start)
a(n) is the number of ordered trees (A000108) with n vertices in which every non-root non-leaf vertex has exactly one leaf child (no restriction on its non-leaf children). For example, a(4) counts the 3 trees
   |             |
   \/    \|/    \/
(End)
From Emeric Deutsch, Oct 28 2014: (Start)
a(n) is the number of symmetric ternary trees having n internal nodes.
a(n) is the number of symmetric non-crossing rooted trees having n edges.
a(n) is the number of symmetric even trees having 2n edges.
a(n) is the number of symmetric diagonally convex directed polyominoes having n diagonals.
(End)
For the above 4 items see the Deutsch-Feretic-Noy reference.
a(n) is also the number of self-dual labeled non-crossing trees with n edges. See my paper in the links section. - Nikos Apostolakis, Jun 11 2019
Number of achiral polyominoes composed of n square cells of the hyperbolic regular tiling with Schläfli symbol {4,oo}. A stereographic projection of this tiling on the Poincaré disk can be obtained via the Christensson link. An achiral polyomino is identical to its reflection. - Robert A. Russell, Jan 20 2024

			G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 7*x^5 + 12*x^6 + 30*x^7 + 55*x^8 + ...

G. C. Greubel, Table of n, a(n) for n = 0..1000
Per Alexandersson, Frether Getachew Kebede, Samuel Asefa Fufa, and Dun Qiu, Pattern-Avoidance and Fuss-Catalan Numbers, J. Int. Seq. (2023) Vol. 26, Art. 23.4.2.
Nikos Apostolakis, Non-crossing trees, quadrangular dissections, ternary trees, and duality preserving bijections arXiv:1804.01214 [math.CO], 2018.
Jean-Luc Baril, Alexander Burstein, and Sergey Kirgizov, Pattern statistics in faro words and permutations, arXiv:2010.06270 [math.CO], 2020. See Theorem 4.4.
Paul Barry, Jacobsthal Decompositions of Pascal's Triangle, Ternary Trees, and Alternating Sign Matrices, Journal of Integer Sequences, 19, 2016, #16.3.5.
Paul Barry, Centered polygon numbers, heptagons and nonagons, and the Robbins numbers, arXiv:2104.01644 [math.CO], 2021.
Paul Barry, Extensions of Riordan Arrays and Their Applications, Mathematics (2025) Vol. 13, No. 2, 242. See pp. 23-24.
L. W. Beineke and R. E. Pippert, Enumerating dissectable polyhedra by their automorphism groups, Can. J. Math., 26 (1974), 50-67.
M. Bousquet and C. Lamathe, Enumeration of solid trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176.
Hassen Cheriha, Yousra Gati, and Vladimir Petrov Kostov, Descartes' rule of signs, Rolle's theorem and sequences of admissible pairs, arXiv:1805.04261 [math.CA], 2018.
Malin Christensson, Make hyperbolic tilings of images, web page, 2019.
S. J. Cyvin, Jianji Wang, J. Brunvoll, Shiming Cao, Ying Li, B. N. Cyvin, and Yugang Wang, Staggered conformers of alkanes: complete solution of the enumeration problem, J. Molec. Struct. 413-414 (1997), 227-239.
S. J. Cyvin et al., Enumeration of staggered conformers of alkanes and monocyclic cycloalkanes, J. Molec. Struct., 445 (1998), 127-137.
Alexander Burstein, Sergi Elizalde, and Toufik Mansour, Restricted Dumont permutations, Dyck paths and noncrossing partitions, arXiv:math/0610234 [math.CO], 2006. [Theorem 3.5]
Emeric Deutsch, Another Path to Generalized Catalan Numbers:Problem 10751, Amer. Math. Monthly, 108 (Nov., 2001), 872-873.
Emeric Deutsch, S. Feretic and M. Noy, Diagonally convex directed polyominoes and even trees: a bijection and related issues, Discrete Math., 256 (2002), 645-654.
F. Hering et al., The enumeration of stack polytopes and simplicial clusters, Discrete Math., 40 (1982), 203-217.
Clark Kimberling, Matrix Transformations of Integer Sequences, J. Integer Seqs., Vol. 6, 2003.
Anthony Zaleski and Doron Zeilberger, On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts, arXiv:1712.10072 [math.CO], 2017.

Column k=3 of A369929 and k=4 of A370062.
Cf. A000108, A032766, A059492.
Cf. A006013 is the odd-indexed terms of this sequence.
Polyominoes: A005034 (oriented), A005036 (unoriented), A369315 (chiral), A385149 (asymmetric), A001764 (rooted), A208355(n-1) {3,oo}, A369472 {5,oo}.

G:=Gamma; [Round((1+(-1)^n)*G(3*n/2+1)/(G(n/2+1)*Factorial(n+1)) + (1-(-1)^n)*G((3*n+1)/2)/(G((n+3)/2)*Factorial(n)))/2: n in [0..35]]; // G. C. Greubel, Jul 07 2019

A047749 := proc(m) if m mod 2 = 1 then x := (m-1)/2; RETURN((3*x+1)!/((x+1)!*(2*x+1)!)); fi; x := m/2; RETURN((3*x)!/(x!*(2*x+1)!)); end;
A047749 := proc(m) local x; if m mod 2 = 1 then x := (m-1)/2; RETURN((3*x+1)!/((x+1)!*(2*x+1)!)); fi; RETURN(A001764(m/2)); end;

a[ n_] := If[ n < 1, Boole[n == 0], SeriesCoefficient[ InverseSeries[ Series[ (x + 2 x^2) / (1 + x)^3, {x, 0, n}]], {x, 0, n}]]; (* Michael Somos, Oct 29 2014 *)
Table[If[OddQ[n],2Binomial[(3n-1)/2,(n-1)/2],Binomial[3n/2,n/2]]/(n+1),{n,0,40}] (* Robert A. Russell, Jan 19 2024 *)

{a(n)=local(A=1+x);for(i=1,n,A=1+x*A^2*subst(A,x,-x+x*O(x^n)));polcoeff(A,n)} \\ Paul D. Hanna, Sep 20 2009

x='x+O('x^66);
C(x)=serreverse(x-x^3); /* =x+x^3+3*x^5+12*x^7+55*x^9 +..., cf. A001764 */
s=1/(1-C(x)); /* g.f. */
Vec(s) /* Joerg Arndt, Apr 16 2011 */

apr(n, p, r) = r*binomial(n*p+r, n)/(n*p+r);
a(n) = apr(n\2, 3, n%2+1); \\ Seiichi Manyama, Jul 20 2025

from math import comb
def A047749(n): return comb(n+(a:=n>>1),a+(b:=n&1))//(n+1-b) # Chai Wah Wu, Jul 30 2022

def A047749_list(n) :
    D = [0]*n; D[1] = 1
    R = []; b = False; h = 1
    for i in range(n) :
        for k in (1..h) :
            D[k] = D[k] + D[k-1]
        R.append(D[h])
        if b : h += 1
        b = not b
    return R
A047749_list(35) # Peter Luschny, May 03 2012

[1]+[((1+(-1)^n)*binomial(3*n/2,n/2)/(n+1) + (1-(-1)^n)* binomial((3*n-1)/2, (n+1)/2)/n)/2 for n in (1..35)] # G. C. Greubel, Jul 07 2019

G.f. is 1+Z, where Z satisfies x*Z^3 + (3*x-2)*Z^2 + (3*x-1)*Z + x = 0. Equivalently, the g.f. Y satisfies x*Y^3 - 2*Y^2 + 3*Y - 1 = 0. - Vladeta Jovovic, Dec 06 2002
Reversion of g.f. (x-2*x^2)/(1-x)^3 (ignoring signs). - Ralf Stephan, Mar 22 2004
G.f.: (4/(3*x))*(sin((1/3)*asin(sqrt(27*x^2/4))))^2 +(2/sqrt(3*x^2))*sin((1/3)*asin(sqrt(27*x^2/4))). - Paul Barry, Nov 08 2006
G.f.: 1/(1-2*sin(asin(3*sqrt(3)*x/2)/3)/sqrt(3)). - Paul Barry, Apr 16 2008
From Paul D. Hanna, Sep 20 2009: (Start)
G.f. satisfies: A(x) = 1 + x*A(x)^2*A(-x);
also, A(x)*A(-x) = B(x^2) where B(x) = 1 + x*B(x)^3 = g.f. of A001764. (End)
G.f.: 1/(1-C(x)) where C(x) = Reverse(x-x^3) = x + x^3 + 3*x^5 + 12*x^7 + 55*x^9 + ... (cf. A001764). - Joerg Arndt, Apr 16 2011
G.f.: G(z^2)+z*G(z^2)^2, where G(z) = 1 + z*G(z)^3, the generating function for A001764. - Robert A. Russell, Jan 26 2024
From Gary W. Adamson, Jul 14 2011: (Start)
a(n) is the upper left term in M^n, M = the infinite square production matrix:
  1, 1, 0, 0, 0, 0, ...
  0, 0, 1, 0, 0, 0, ...
  1, 1, 0, 1, 0, 0, ...
  0, 0, 1, 0, 1, 0, ...
  1, 1, 0, 1, 0, 1, ...
  ... (End)
Conjecture D-finite with recurrence: 8*n*(n+1)*a(n) + 36*n*(n-2)*a(n-1) - 6*(9*n^2-18*n+14)*a(n-2) - 27*(3*n-7)*(3*n-8)*a(n-3) = 0. - R. J. Mathar, Dec 19 2011
0 = a(n)*(+7308954*a(n+2) - 16659999*a(n+3) - 4854519*a(n+4) + 6201838*a(n+5)) + a(n+1)*(-406053*a(n+2) - 1627560*a(n+3) + 1683538*a(n+4) - 245747*a(n+5)) + a(n+2)*(+45117*a(n+2) + 235870*a(n+3) + 173953*a(n+4) - 484295*a(n+5)) + a(n+3)*(-41820*a(n+3) - 50184*a(n+4) + 22304*a(n+5)) for all n in Z if a(-1) = -2/3. - Michael Somos, Oct 29 2014
a(0) = 1; a(n) = Sum_{i=0..n-1} Sum_{j=0..n-i-1} (-1)^i * a(i) * a(j) * a(n-i-j-1). - Ilya Gutkovskiy, Jul 28 2021
a(n) = binomial(A032766(n),floor((n+1)/2))/(2*floor(n/2)+1). - Miko Labalan, Nov 28 2023
a(n) = 2*A005036(n) - A005034(n) = A005034(n) - 2*A369315(n) = A005036(n) - A369315(n). - Robert A. Russell, Jan 20 2024
From Robert A. Russell, Mar 20 2024: (Start)
a(n) = U(n) in the Beineke and Pippert link.
G.f.: E(1)(t*E(3)(t^2)) (second entry in Table 1), where E(d)(t) is defined in formula 3 of Hering link. (End)
From Robert A. Russell, Jul 15 2024: (Start)
a(2m) = A001764(m) ~ (3^3/2^2)^m*sqrt(3/(2*Pi*(2*m)^3)).
a(n+2)/a(n) ~ 27/4; a(2m+1)/a(2m) ~ 3; a(2m)/a(2m-1) ~ 9/4. (End)
a(n) ~ 3^((6n+3)/4)/(sqrt(Pi)*2^((2n-1)/2)*(2n+1)^(3/2)). - Miko Labalan, Dec 05 2024
a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} a(2*k) * a(n-1-2*k). - Seiichi Manyama, Jul 07 2025

A143546 G.f. A(x) satisfies A(x) = 1 + xA(x)^3A(-x)^2.

Original entry on oeis.org

1, 1, 1, 3, 5, 18, 35, 136, 285, 1155, 2530, 10530, 23751, 100688, 231880, 996336, 2330445, 10116873, 23950355, 104819165, 250543370, 1103722620, 2658968130, 11777187240, 28558343775, 127067830773, 309831575760, 1383914371728, 3390416787880, 15194457001440

Offset: 0

Paul D. Hanna, Aug 23 2008

Number of achiral polyominoes composed of n hexagonal cells of the hyperbolic regular tiling with Schläfli symbol {6,oo}. A stereographic projection of the {6,oo} tiling on the Poincaré disk can be obtained via the Christensson link. - Robert A. Russell, Jan 23 2024

Number of achiral noncrossing partitions composed of n blocks of size 5. - Andrew Howroyd, Feb 08 2024

			G.f.: A(x) = 1 + x + x^2 + 3*x^3 + 5*x^4 + 18*x^5 + 35*x^6 + 136*x^7 + ...
A(x) = 1 + x*A(x)^3*A(-x)^2 where
A(x)^3 = 1 + 3x + 6x^2 + 16x^3 + 39x^4 + 114x^5 + 304x^6 + 936x^7 + ...
A(-x)^2 = 1 - 2x + 3x^2 - 8x^3 + 17x^4 - 52x^5 + 125x^6 - 408x^7 + ...
Also, A(x) = G(x^2) + x*G(x^2)^3 where
G(x) = 1 + x + 5*x^2 + 35*x^3 + 285*x^4 + 2530*x^5 + 23751*x^6 + ...
G(x)^3 = 1 + 3*x + 18*x^2 + 136*x^3 + 1155*x^4 + 10530*x^5 + ...

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176. See Table 1. - From _N. J. A. Sloane_, Jul 12 2011
Malin Christensson, Make hyperbolic tilings of images, web page, 2019.

Column k=5 of A369929 and k=6 of A370062.
Cf. A118970.
Polyominoes: A221184(n-1) (oriented), A004127 (unoriented), A369473 (chiral), A002294 (rooted), A047749 {4,oo}, A369472 {5,oo}.

terms = 28;
A[] = 1; Do[A[x] = 1 + x A[x]^3 A[-x]^2 + O[x]^terms // Normal, {terms}];
CoefficientList[A[x], x] (* Jean-François Alcover, Jul 24 2018 *)
p=6; Table[If[EvenQ[n],Binomial[(p-1)n/2,n/2]/((p-2)n/2+1),If[OddQ[p],(p-1)Binomial[(p-1)n/2-1,(n-1)/2]/((p-2)n+1),p Binomial[(p-1)n/2-1/2,(n-1)/2]/((p-2)n+2)]],{n,0,35}] (* Robert A. Russell, Jan 23 2024 *)

{a(n)=my(A=1+O(x^(n+1)));for(i=0,n,A=1+x*A^3*subst(A^2,x,-x));polcoef(A,n)}

{a(n)=my(m=n\2,p=2*(n%2)+1);binomial(5*m+p-1,m)*p/(4*m+p)}

G.f.: A(x) = G(x^2) + x*G(x^2)^3 where G(x) = 1 + x*G(x)^5 is the g.f. of A002294.
a(2n) = binomial(5*n,n)/(4*n+1); a(2n+1) = binomial(5*n+2,n)*3/(4*n+3).
From Robert A. Russell, Jan 23 2024: (Start)
a(n+2)/a(n) ~ 3125/256. a(2m+1)/a(2m) ~ 75/16; a(2m)/a(2m-1) ~ 125/48.
a(n) = 2*A004127(n) - A221184(n-1) = A221184(n-1) - 2*A369473(n) = A004127(n) - A369473(n). (End)
a(2m) = A002294(m) ~ (5^5/4^4)^m*sqrt(5/(2*Pi*(4*m)^3)). - Robert A. Russell, Jul 15 2024
From Seiichi Manyama, Jul 07 2025: (Start)
G.f. A(x) satisfies A(x)*A(-x) = (A(x) + A(-x))/2 = G(x^2), where G(x) = 1 + x*G(x)^5 is the g.f. of A002294.
a(0) = 1; a(n) = Sum_{i, j, k>=0 and i+2*j+2*k=n-1} a(i) * a(2*j) * a(2*k). (End)
a(0) = 1; a(n) = Sum_{i, j, k, l, m>=0 and i+j+k+l+m=n-1} (-1)^(i+j) * a(i) * a(j) * a(k) * a(l) * a(m). - Seiichi Manyama, Jul 08 2025

A143554 G.f. A(x) satisfies A(x) = 1 + xA(x)^5A(-x)^4.

Original entry on oeis.org

1, 1, 1, 5, 9, 55, 117, 775, 1785, 12350, 29799, 211876, 527085, 3818430, 9706503, 71282640, 184138713, 1366368375, 3573805950, 26735839650, 70625252863, 531838637759, 1416298046436, 10723307329700, 28748759731965, 218658647805780, 589546754316126

Offset: 0

Paul D. Hanna, Aug 24 2008

nonn

Number of achiral noncrossing partitions composed of n blocks of size 9. - Andrew Howroyd, Feb 08 2024

			G.f.: A(x) = 1 + x + x^2 + 5*x^3 + 9*x^4 + 55*x^5 + 117*x^6 + 775*x^7 +...
Let G(x) = 1 + x*G(x)^9 be the g.f. of A062994, then
G(x^2) = A(x)*A(-x) and A(x) = G(x^2) + x*G(x^2)^5 where
G(x) = 1 + x + 9*x^2 + 117*x^3 + 1785*x^4 + 29799*x^5 + 527085*x^6 +...
G(x)^5 = 1 + 5*x + 55*x^2 + 775*x^3 + 12350*x^4 + 211876*x^5 +...

Andrew Howroyd, Table of n, a(n) for n = 0..500
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176. See Table 1. - From _N. J. A. Sloane_, Jul 12 2011

Column k=9 of A369929 and k=10 of A370062.
Cf. A143338, A143546, A143547, A143550, A062994 (bisection).
Cf. A143551, A143552, A143553.
Cf. A143047.

terms = 25;
A[] = 1; Do[A[x] = 1 + x A[x]^5 A[-x]^4 + O[x]^terms // Normal, {terms}];
CoefficientList[A[x], x] (* Jean-François Alcover, Jul 24 2018 *)

{a(n)=my(A=1+x*O(x^n));for(i=0,n,A=1+x*A^5*subst(A^4,x,-x));polcoef(A,n)}

{a(n)=my(m=n\2,p=4*(n%2)+1);binomial(9*m+p-1,m)*p/(8*m+p)}

G.f. satisfies: A(x) = [A(x)*A(-x)] + x*[A(x)*A(-x)]^5.
G.f. satisfies: A(x)*A(-x) = (A(x) + A(-x))/2 = G(x^2) where G(x) = 1 + x*G(x)^9 is the g.f. of A062994.
a(2n) = binomial(9*n,n)/(8*n+1); a(2n+1) = binomial(9*n+4,n)*5/(8*n+5).
a(0) = 1; a(n) = Sum_{i, j, k, l, m>=0 and i+2*j+2*k+2*l+2*m=n-1} a(i) * a(2*j) * a(2*k) * a(2*l) * a(2*m). - Seiichi Manyama, Jul 07 2025
a(0) = 1; a(n) = Sum_{x_1, x_2, ..., x_9>=0 and x_1+x_2+...+x_9=n-1} (-1)^(x_1+x_2+x_3+x_4) * Product_{k=1..9} a(x_k). - Seiichi Manyama, Jul 09 2025

A143547 G.f. A(x) satisfies A(x) = 1 + xA(x)^4A(-x)^3.

Original entry on oeis.org

1, 1, 1, 4, 7, 34, 70, 368, 819, 4495, 10472, 59052, 141778, 814506, 1997688, 11633440, 28989675, 170574723, 430321633, 2552698720, 6503352856, 38832808586, 99726673130, 598724403680, 1547847846090, 9335085772194, 24269405074740, 146936230074004, 383846168712104

Offset: 0

Paul D. Hanna, Aug 23 2008

nonn

Number of achiral noncrossing partitions composed of n blocks of size 7. - Andrew Howroyd, Feb 08 2024

			G.f.: A(x) = 1 + x + x^2 + 4*x^3 + 7*x^4 + 34*x^5 + 70*x^6 + 368*x^7 + ...
Let G(x) = 1 + x*G(x)^7 be the g.f. of A002296, then
A(x)*A(-x) = G(x^2) and A(x) = G(x^2) + x*G(x^2)^4 where
G(x) = 1 + x + 7*x^2 + 70*x^3 + 819*x^4 + 10472*x^5 + 141778*x^6 + ...
G(x)^4 = 1 + 4*x + 34*x^2 + 368*x^3 + 4495*x^4 + 59052*x^5 + ...
form the bisections of A(x).
By definition, A(x) = 1 + x*A(x)^4*A(-x)^3 where
A(x)^4 = 1 + 4*x + 10*x^2 + 32*x^3 + 95*x^4 + 332*x^5 + 1074*x^6 + ...
A(-x)^3 = 1 - 3*x + 6*x^2 - 19*x^3 + 51*x^4 - 183*x^5 + 550*x^6 -+ ...

Andrew Howroyd, Table of n, a(n) for n = 0..500
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176, See Table 1. - From _N. J. A. Sloane_, Jul 12 2011

Column k=7 of A369929 and k=8 of A370062.
Cf. A002296 (bisection), A143546.
Cf. A143549, A143550.
Cf. A143046, A143553.

terms = 26;
A[] = 1; Do[A[x] = 1 + x A[x]^4 A[-x]^3 + O[x]^terms // Normal, {terms}];
CoefficientList[A[x], x] (* Jean-François Alcover, Jul 24 2018 *)

{a(n)=my(A=1+O(x^(n+1)));for(i=0,n,A=1+x*A^4*subst(A^3,x,-x));polcoef(A,n)}

{a(n)=my(m=n\2,p=3*(n%2)+1);binomial(7*m+p-1,m)*p/(6*m+p)}

G.f.: A(x) = G(x^2) + x*G(x^2)^4 where G(x^2) = A(x)*A(-x) and G(x) = 1 + x*G(x)^7 is the g.f. of A002296.
a(2n) = binomial(7*n,n)/(6*n+1); a(2n+1) = binomial(7*n+3,n)*4/(6*n+4).
G.f. satisfies: A(x)*A(-x) = (A(x) + A(-x))/2.
a(0) = 1; a(n) = Sum_{i, j, k, l>=0 and i+2*j+2*k+2*l=n-1} a(i) * a(2*j) * a(2*k) * a(2*l). - Seiichi Manyama, Jul 07 2025
a(0) = 1; a(n) = Sum_{x_1, x_2, ..., x_7>=0 and x_1+x_2+...+x_7=n-1} (-1)^(x_1+x_2+x_3) * Product_{k=1..7} a(x_k). - Seiichi Manyama, Jul 08 2025

a(26) onwards from Andrew Howroyd, Feb 08 2024

A370062 Array read by antidiagonals: T(n,k) is the number of achiral dissections of a polygon into n k-gons by nonintersecting diagonals, n >= 1, k >= 3.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 3, 4, 7, 5, 1, 1, 3, 5, 9, 12, 5, 1, 1, 4, 6, 18, 22, 30, 14, 1, 1, 4, 7, 21, 35, 52, 55, 14, 1, 1, 5, 8, 34, 51, 136, 140, 143, 42, 1, 1, 5, 9, 38, 70, 190, 285, 340, 273, 42, 1, 1, 6, 10, 55, 92, 368, 506, 1155, 969, 728, 132

Offset: 1

Andrew Howroyd, Feb 08 2024

The polygon prior to dissection will have n*(k-2)+2 sides.

			Array begins:
=============================================
n\k|  3   4   5    6    7    8    9    10 ...
---+-----------------------------------------
1  |  1   1   1    1    1    1    1     1 ...
2  |  1   1   1    1    1    1    1     1 ...
3  |  1   2   2    3    3    4    4     5 ...
4  |  2   3   4    5    6    7    8     9 ...
5  |  2   7   9   18   21   34   38    55 ...
6  |  5  12  22   35   51   70   92   117 ...
7  |  5  30  52  136  190  368  468   775 ...
8  | 14  55 140  285  506  819 1240  1785 ...
9  | 14 143 340 1155 1950 4495 6545 12350 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 antidiagonals)
F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.
Wikipedia, Fuss-Catalan number

Columns are A208355(n-1), A047749 (k=4), A369472 (k=5), A143546 (k=6), A143547 (k=8), A143554 (k=10), A192893 (k=12).

Cf. A070914 (rooted), A295224 (oriented), A295260 (unoriented), A369929, A370060 (achiral rooted at cell).

\\ here u is Fuss-Catalan sequence with p = k-1.
u(n, k, r) = {r*binomial((k - 1)*n + r, n)/((k - 1)*n + r)}
T(n, k) = {(if(n%2, u((n-1)/2, k, k\2), if(k%2, u(n/2-1, k, k-1), u(n/2, k, 1))))}
for(n=1, 9, for(k=3, 10, print1(T(n, k), ", ")); print);

T(n,k) = 2*A295260(n,k) - A295224(n,k).
T(n,2*k+1) = A370060(n,2*k+1).
T(n,2*k) = A369929(n,2*k-1).

A370060 Array read by antidiagonals: T(n,k) is the number of achiral dissections of a polygon into n k-gons by nonintersecting diagonals rooted at a cell, n >= 1, k >= 3.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 2, 4, 2, 1, 1, 4, 4, 12, 5, 1, 1, 3, 6, 9, 18, 5, 1, 1, 5, 6, 26, 22, 55, 14, 1, 1, 4, 8, 21, 45, 52, 88, 14, 1, 1, 6, 8, 45, 51, 204, 140, 273, 42, 1, 1, 5, 10, 38, 84, 190, 380, 340, 455, 42, 1, 1, 7, 10, 69, 92, 500, 506, 1771, 969, 1428, 132

Offset: 1

Andrew Howroyd, Feb 08 2024

The polygon prior to dissection will have n*(k-2)+2 sides.

			Array begins:
=============================================
n\k|  3   4   5    6    7    8    9    10 ...
---+-----------------------------------------
1  |  1   1   1    1    1    1    1     1 ...
2  |  1   1   1    1    1    1    1     1 ...
3  |  1   3   2    4    3    5    4     6 ...
4  |  2   4   4    6    6    8    8    10 ...
5  |  2  12   9   26   21   45   38    69 ...
6  |  5  18  22   45   51   84   92   135 ...
7  |  5  55  52  204  190  500  468   992 ...
8  | 14  88 140  380  506 1008 1240  2100 ...
9  | 14 273 340 1771 1950 6200 6545 15990 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 antidiagonals)
F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.
Wikipedia, Fuss-Catalan number

Columns k=3..6 are A208355(n-1), A124817(n-1), A369472, A370061.

Cf. A070914 (rooted), A295222 (oriented), A295259 (unoriented), A369929, A370062 (achiral unrooted).

\\ here u is Fuss-Catalan sequence with p = k-1.
u(n, k, r) = {r*binomial((k - 1)*n + r, n)/((k - 1)*n + r)}
T(n, k) = {if(k%2, if(n%2, u((n-1)/2, k, (k-1)/2), u(n/2-1, k, (k-1))), if(n%2, u((n-1)/2, k, k/2+1), u(n/2-1, k, k)) )}
for(n=1, 9, for(k=3, 10, print1(T(n, k), ", ")); print);

T(n,k) = 2*A295259(n,k) - A295222(n,k).

T(n,2*k+1) = A370062(n,2*k+1).

cp's OEIS Frontend

A047749 If n = 2*m then a(n) = binomial(3*m, m)/(2*m+1), if n=2*m+1 then a(n) = binomial(3*m+1, m+1)/(2*m+1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Sage

Formula

A143546 G.f. A(x) satisfies A(x) = 1 + x*A(x)^3*A(-x)^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A143554 G.f. A(x) satisfies A(x) = 1 + x*A(x)^5*A(-x)^4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A143547 G.f. A(x) satisfies A(x) = 1 + x*A(x)^4*A(-x)^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A370062 Array read by antidiagonals: T(n,k) is the number of achiral dissections of a polygon into n k-gons by nonintersecting diagonals, n >= 1, k >= 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A370060 Array read by antidiagonals: T(n,k) is the number of achiral dissections of a polygon into n k-gons by nonintersecting diagonals rooted at a cell, n >= 1, k >= 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A047749 If n = 2m then a(n) = binomial(3m, m)/(2m+1), if n=2m+1 then a(n) = binomial(3m+1, m+1)/(2m+1).

A143546 G.f. A(x) satisfies A(x) = 1 + xA(x)^3A(-x)^2.

A143554 G.f. A(x) satisfies A(x) = 1 + xA(x)^5A(-x)^4.

A143547 G.f. A(x) satisfies A(x) = 1 + xA(x)^4A(-x)^3.