A192893 -id:A192893 - cp's OEIS frontend

A369929 Array read by antidiagonals: T(n,k) is the number of achiral noncrossing partitions composed of n blocks of size k.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 3, 3, 6, 1, 1, 1, 1, 3, 5, 7, 10, 1, 1, 1, 1, 4, 5, 16, 12, 20, 1, 1, 1, 1, 4, 7, 18, 31, 30, 35, 1, 1, 1, 1, 5, 7, 31, 35, 102, 55, 70, 1, 1, 1, 1, 5, 9, 34, 64, 136, 213, 143, 126, 1

Offset: 0

Andrew Howroyd, Feb 07 2024

T(n,2*k-1) is the number of achiral noncrossing k-gonal cacti with n polygons.

			Array begins:
===============================================
n\k| 1  2   3   4    5    6    7    8     9 ...
---+-------------------------------------------
0  | 1  1   1   1    1    1    1    1     1 ...
1  | 1  1   1   1    1    1    1    1     1 ...
2  | 1  1   1   1    1    1    1    1     1 ...
3  | 1  2   2   3    3    4    4    5     5 ...
4  | 1  3   3   5    5    7    7    9     9 ...
5  | 1  6   7  16   18   31   34   51    55 ...
6  | 1 10  12  31   35   64   70  109   117 ...
7  | 1 20  30 102  136  296  368  651   775 ...
8  | 1 35  55 213  285  663  819 1513  1785 ...
9  | 1 70 143 712 1155 3142 4495 9304 12350 ...
...

Andrew Howroyd, Table of n, a(n) for n = 0..1325 (first 51 antidiagonals)
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176. See Table 1.
Wikipedia, Fuss-Catalan number.
Wikipedia, Noncrossing partition.

Columns are: A000012, A001405(n-1), A047749 (k=3), A369930 (k=4), A143546 (k=5), A143547 (k=7), A143554 (k=9), A192893 (k=11).

Cf. A070914, A303694, A303929, A361236, A361239, A370060, A370062.

\\ u(n,k,r) are Fuss-Catalan numbers.
u(n,k,r) = {r*binomial(k*n + r, n)/(k*n + r)}
e(n,k) = {sum(j=0, n\2, u(j, k, 1+(n-2*j)*k/2))}
T(n, k)={if(n==0, 1, if(k%2, if(n%2, 2*u(n\2, k, (k+1)/2), u(n/2, k, 1) + u(n/2-1, k, k)), e(n, k) + if(n%2, u(n\2, k, k/2)))/2)}

T(n,k) = 2*A303929(n,k) - A303694(n,k).

T(n,2*k-1) = 2*A361239(n,k) - A361236(n,k).

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).

A192894 Number of symmetric 13-ary factorizations of the n-cycle (1,2...n).

Original entry on oeis.org

1, 1, 1, 7, 13, 112, 247, 2310, 5525, 53998, 135408, 1360289, 3518515, 36017352, 95223414, 988172368, 2655417765, 27844071255, 75769712590, 801012669457, 2201663313200, 23428926096576, 64924369564353, 694644371065372, 1938034271677595, 20829931845958872, 58448142042957576

Offset: 0

N. J. A. Sloane, Jul 12 2011

nonn

The six sequences displayed in Table 1 of the Bousquet-Lamathe reference are A047749, A143546, A143547, A143554, A192893, A192894. From this one should be able to guess a g.f.

Andrew Howroyd, Table of n, a(n) for n = 0..200
Michel Bousquet and Cédric Lamathe, On symmetric structures of order two, Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176. See Table 1.

Column k=13 of A369929 and k=14 of A370062.

Cf. A143049.

From Seiichi Manyama, Jul 07 2025: (Start)
G.f. A(x) satisfies A(x) = 1/( 1 - x*(A(x)*A(-x))^6 ).
G.f. A(x) satisfies A(x)*A(-x) = (A(x) + A(-x))/2 = G(x^2), where G(x) = 1 + x*G(x)^13.
a(0) = 1; a(n) = Sum_{x_1, x_2, ..., x_7>=0 and x_1+2*(x_2+x_3+...+x_7)=n-1} a(x_1) * Product_{k=2..7} a(2*x_k). (End)
a(0) = 1; a(n) = Sum_{x_1, x_2, ..., x_13>=0 and x_1+x_2+...+x_13=n-1} (-1)^(x_1+x_2+x_3+x_4+x_5+x_6) * Product_{k=1..13} a(x_k). - Seiichi Manyama, Jul 09 2025

a(11) onwards from Andrew Howroyd, Jan 26 2024

a(0)=1 prepended by Seiichi Manyama, Jul 07 2025

cp's OEIS Frontend

A369929 Array read by antidiagonals: T(n,k) is the number of achiral noncrossing partitions composed of n blocks of size k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

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

A192894 Number of symmetric 13-ary factorizations of the n-cycle (1,2...n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions