A349426 - OEIS

%I #20 Dec 10 2021 05:55:14

%S 3,8,30,144,90,840,840,5760,7280,45360,66528,7560,403200,657720,

%T 151200,3991680,7064640,2356200,43545600,82285632,34890240,1247400,

%U 518918400,1035365760,521080560,43243200,6706022400,14013679680,8034586560,1059458400

%N Irregular triangle read by rows: T(n,k) is the number of arrangements of n labeled children with exactly k nontrivial rounds; n >= 3, 1 <= k <= floor(n/3).

%C A nontrivial round means the same as a ring or circle consisting of more than one child.

%D R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999 (Sec. 5.2)

%H Steven Finch, <a href="https://arxiv.org/abs/2111.14487">Rounds, Color, Parity, Squares</a>, arXiv:2111.14487 [math.CO], 2021.

%F E.g.f.: (1 - x)^(-x*t) * exp(-x^2*t).

%e Triangle starts:

%e [3]           3;

%e [4]           8;

%e [5]          30;

%e [6]         144,          90;

%e [7]         840,         840;

%e [8]        5760,        7280;

%e [9]       45360,       66528,       7560;

%e [10]     403200,      657720,     151200;

%e [11]    3991680,     7064640,    2356200;

%e [12]   43545600,    82285632,   34890240,    1247400;

%e [13]  518918400,  1035365760,  521080560,   43243200;

%e [14] 6706022400, 14013679680, 8034586560, 1059458400;

%e ...

%e For n = 6, there are 144 ways to make one round and 90 ways to make two rounds.

%t f[k_, n_] := n! SeriesCoefficient[(1 - x)^(-x t) Exp[-x^2 t], {x, 0, n}, {t, 0, k}]

%t Table[f[k, n], {n, 2, 14}, {k, 1, Floor[n/3]}]

%Y Row sums give A066165 (variant of Stanley's children's game).

%Y Column 1 gives A001048.

%Y Right border element of row n is A166334(n/3) for each n divisible by 3.

%Y Cf. A066166, A349280 (correspond to Stanley's original game).

%K nonn,tabf

%O 3,1

%A _Steven Finch_, Nov 17 2021