|
%I #51 Jan 02 2022 18:29:10
%S 1,0,1,0,2,2,0,3,18,6,0,4,84,144,24,0,5,300,1500,1200,120,0,6,930,
%T 10800,23400,10800,720,0,7,2646,63210,294000,352800,105840,5040,0,8,
%U 7112,324576,2857680,7056000,5362560,1128960,40320
%N Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).
%C Another version is in A101817. - _Philippe Deléham_, Feb 16 2013
%H Alois P. Heinz, <a href="/A090657/b090657.txt">Rows n = 0..62, flattened</a>
%H C. M. Ringel, <a href="http://arxiv.org/abs/1502.06553">The Catalan combinatorics of the hereditary artin algebras</a>, arXiv preprint arXiv:1502.06553, 2015
%F T(n,k) = C(n,k) * k! * A048993(n,k).
%F T(n,k) = A008279(n,k) * A048993(n,k).
%F T(n,k) = C(n,k) * A019538(n, k).
%F T(n,k) = C(n,k) * Sum_{j=0..k} (-1)^(k-j) * C(k,j) * j^n.
%F T(n,k) = n * (T(n-1,k-1) + k/(n-k) * T(n-1,k)) with T(n,n) = n! and T(n,0) = 0 for n>0.
%F T(2n,n) = A288312(n). - _Alois P. Heinz_, Jun 07 2017
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 2, 2;
%e 0, 3, 18, 6;
%e 0, 4, 84, 144, 24;
%e ...
%p T:= proc(n,k) option remember;
%p if k=n then n!
%p elif k=0 or k>n then 0
%p else n * (T(n-1,k-1) + k/(n-k) * T(n-1,k))
%p fi
%p end:
%p seq(seq(T(n,k), k=0..n), n=0..10);
%t Table[Table[StirlingS2[n, k] Binomial[n, k] k!, {k, 0, n}], {n, 0,10}] // Flatten (* _Geoffrey Critzer_, Sep 09 2011 *)
%Y Row sums give: A000312. Columns k=0-2 give: A000007, A001477, A068605. Diagonal, lower diagonal give: A000142, A001804. Cf. A007318, A048993, A019538, A008279.
%Y Cf. A101817, A288312.
%K easy,nonn,tabl
%O 0,5
%A _Philippe Deléham_, Dec 14 2003
%E Revised description from Jan Maciak, Apr 25 2004
%E Edited by _Alois P. Heinz_, Jan 17 2011
|
