This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350452 #28 Jan 21 2023 04:29:08
%S A350452 1,0,0,1,0,8,0,78,3,0,944,80,0,13800,1810,15,0,237432,41664,840,0,
%T A350452 4708144,1022252,34300,105,0,105822432,27098784,1286432,10080,0,
%U A350452 2660215680,778128336,47790540,648900,945,0,73983185000,24165049920,1815578160,36048320,138600
%N A350452 Number T(n,k) of endofunctions on [n] with exactly k connected components and no fixed points; triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.
%C A350452 For k >= 2 and p prime, T(p,k) == 0 (mod 4*p*(p-1)). - _Mélika Tebni_, Jan 20 2023
%H A350452 Alois P. Heinz, <a href="/A350452/b350452.txt">Rows n = 0..200, flattened</a>
%F A350452 From _Mélika Tebni_, Jan 20 2023: (Start)
%F A350452 E.g.f. column k: (LambertW(-x) - log(1 + LambertW(-x)))^k / k!.
%F A350452 -Sum_{k=1..n/2} (-1)^k*T(n,k) = A071720(n+1), for n > 0.
%F A350452 -Sum_{k=1..n/2} (-1)^k*T(n,k) / (n-1) = A007830(n-2), for n > 1.
%F A350452 T(n,k) = Sum_{j=k..n} n^(n-j)*binomial(n-1, j-1)*A106828(j, k) for n > 0. (End)
%e A350452 Triangle T(n,k) begins:
%e A350452 1;
%e A350452 0;
%e A350452 0, 1;
%e A350452 0, 8;
%e A350452 0, 78, 3;
%e A350452 0, 944, 80;
%e A350452 0, 13800, 1810, 15;
%e A350452 0, 237432, 41664, 840;
%e A350452 0, 4708144, 1022252, 34300, 105;
%e A350452 0, 105822432, 27098784, 1286432, 10080;
%e A350452 0, 2660215680, 778128336, 47790540, 648900, 945;
%e A350452 ...
%p A350452 c:= proc(n) option remember; add(n!*n^(n-k-1)/(n-k)!, k=2..n) end:
%p A350452 b:= proc(n) option remember; expand(`if`(n=0, 1, add(
%p A350452 b(n-i)*binomial(n-1, i-1)*x*c(i), i=1..n)))
%p A350452 end:
%p A350452 T:= n-> (p-> seq(coeff(p, x, i), i=0..n/2))(b(n)):
%p A350452 seq(T(n), n=0..12);
%t A350452 c[n_] := c[n] = Sum[n!*n^(n - k - 1)/(n - k)!, {k, 2, n}];
%t A350452 b[n_] := b[n] = Expand[If[n == 0, 1, Sum[
%t A350452 b[n - i]*Binomial[n - 1, i - 1]*x*c[i], {i, 1, n}]]];
%t A350452 T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, n/2}]][b[n]];
%t A350452 Table[T[n], {n, 0, 12}] // Flatten (* _Jean-François Alcover_, Mar 18 2022, after _Alois P. Heinz_ *)
%o A350452 (PARI) \\ here AS1(n,k) gives associated Stirling numbers of 1st kind.
%o A350452 AS1(n,k)={(-1)^(n+k)*sum(i=0, k, (-1)^i * binomial(n, i) * stirling(n-i, k-i, 1) )}
%o A350452 T(n,k) = {if(n==0, k==0, sum(j=k, n, n^(n-j)*binomial(n-1, j-1)*AS1(j,k)))} \\ _Andrew Howroyd_, Jan 20 2023
%Y A350452 Columns k=0-1 give: A000007, A000435.
%Y A350452 Row sums give A065440.
%Y A350452 T(2n,n) gives A001147.
%Y A350452 Cf. A060281, A061356, A350446.
%Y A350452 Cf. A071720, A007830, A106828.
%K A350452 nonn,tabf
%O A350452 0,6
%A A350452 _Alois P. Heinz_, Dec 31 2021