|
%I #25 Feb 17 2022 14:07:20
%S 1,1,4,27,255,1,3094,31,45865,791,803424,20119,16239720,528991,8505,
%T 372076163,14689441,654885,9529560676,435580164,34859160,269819334245,
%U 13846282341,1646054025,8369112382488,471890017358,73811825010,1286223400
%N Irregular triangle read by rows: T(n,k) is the number of endofunctions on [n] whose fourth-largest component has size exactly k; n >= 0, 0 <= k <= floor(n/4).
%C An endofunction on [n] is a function from {1,2,...,n} to {1,2,...,n}.
%C If the mapping has no fourth component, then its fourth-largest component is defined to have size 0.
%H Alois P. Heinz, <a href="/A350275/b350275.txt">Rows n = 0..100, flattened</a>
%H Steven Finch, <a href="http://arxiv.org/abs/2202.07621">Second best, Third worst, Fourth in line</a>, arxiv:2202.07621 [math.CO], 2022.
%e Triangle begins:
%e 1;
%e 1;
%e 4;
%e 27;
%e 255, 1;
%e 3094, 31;
%e 45865, 791;
%e 803424, 20119;
%e ...
%p g:= proc(n) option remember; add(n^(n-j)*(n-1)!/(n-j)!, j=1..n) end:
%p b:= proc(n, l) option remember; `if`(n=0, x^l[1], add(g(i)*
%p b(n-i, sort([l[], i])[-4..-1])*binomial(n-1, i-1), i=1..n))
%p end:
%p T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n, [0$4])):
%p seq(T(n), n=0..14); # _Alois P. Heinz_, Dec 22 2021
%t g[n_] := g[n] = Sum[n^(n - j)*(n - 1)!/(n - j)!, {j, 1, n}];
%t b[n_, l_] := b[n, l] = If[n == 0, x^l[[1]], Sum[g[i]*b[n - i, Sort[ Append[l, i]][[-4 ;; -1]]]*Binomial[n - 1, i - 1], {i, 1, n}]];
%t T[n_] := With[{p = b[n, {0, 0, 0, 0}]}, Table[Coefficient[p, x, i], {i, 0, Exponent[p, x]}]];
%t Table[T[n], {n, 0, 14}] // Flatten (* _Jean-François Alcover_, Dec 28 2021, after _Alois P. Heinz_ *)
%Y Row sums give A000312.
%Y Cf. A001865, A350078, A350079, A350080, A350081, A350276.
%K nonn,tabf
%O 0,3
%A _Steven Finch_, Dec 22 2021
|
