cp's OEIS Frontend

A059024 Triangle of Stirling numbers of order 5.

%I A059024 #27 Apr 08 2022 21:02:35
%S A059024 1,1,1,1,1,1,126,1,462,1,1254,1,3003,1,6721,1,14443,126126,1,30251,
%T A059024 1009008,1,62322,5309304,1,127024,23075052,1,257108,89791416,1,518092,
%U A059024 325355316,488864376,1,1041029,1122632043,6844101264,1,2088043
%N A059024 Triangle of Stirling numbers of order 5.
%C A059024 The number of partitions of the set N, |N|=n, into k blocks, all of cardinality greater than or equal to 5. This is the 5-associated Stirling number of the second kind.
%C A059024 This is entered as a triangular array. The entries S_5(n,k) are zero for 5k>n, so these values are omitted. Initial entry in sequence is S_5(5,1).
%C A059024 Rows are of lengths 1,1,1,1,1,2,2,2,2,2,3,3,3,3,3,...
%D A059024 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 222.
%D A059024 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 76.
%H A059024 Alois P. Heinz, <a href="/A059024/b059024.txt">Rows n = 5..320, flattened</a>
%H A059024 A. E. Fekete, <a href="http://www.jstor.org/stable/2974533">Apropos two notes on notation</a>, Amer. Math. Monthly, 101 (1994), 771-778.
%F A059024 S_r(n+1, k) = k*S_r(n, k) + binomial(n, r-1)*S_r(n-r+1, k-1); for this sequence, r=5.
%F A059024 G.f.: Sum_{n>=0, k>=0} S_r(n,k)*u^k*t^n/n! = exp(u(e^t-sum(t^i/i!, i=0..r-1))).
%F A059024 T(n,k) = Sum_{j=0..min(n/4,k)} (-1)^j*n!/(24^j*j!*(n-4j)!)*S_4(n-4j,k-j), where S_4 are the 4-associated Stirling numbers of the second kind A059023. - _Fabián Pereyra_, Feb 21 2022
%e A059024 There are 126 ways of partitioning a set N of cardinality 10 into 2 blocks each of cardinality at least 5, so S_5(10,2) = 126.
%e A059024 Triangle begins:
%e A059024 1;
%e A059024 1;
%e A059024 1;
%e A059024 1;
%e A059024 1;
%e A059024 1,    126;
%e A059024 1,    462;
%e A059024 1,   1254;
%e A059024 1,   3003;
%e A059024 1,   6721;
%e A059024 1,  14443,    126126;
%e A059024 1,  30251,   1009008;
%e A059024 1,  62322,   5309304;
%e A059024 1, 127024,  23075052;
%e A059024 1, 257108,  89791416;
%e A059024 1, 518092, 325355316, 488864376;
%e A059024 ...
%p A059024 T:= proc(n,k) option remember; `if`(k<1 or k>n/5, 0,
%p A059024       `if`(k=1, 1, k*T(n-1, k)+binomial(n-1, 4)*T(n-5, k-1)))
%p A059024     end:
%p A059024 seq(seq(T(n, k), k=1..n/5), n=5..25);  # _Alois P. Heinz_, Aug 18 2017
%t A059024 S5[n_ /; 5 <= n <= 9, 1] = 1; S5[n_, k_] /; 1 <= k <= Floor[n/5] := S5[n, k] = k*S5[n-1, k] + Binomial[n-1, 4]*S5[n-5, k-1]; S5[_, _] = 0; Flatten[ Table[ S5[n, k], {n, 5, 25}, {k, 1, Floor[n/5]}]] (* _Jean-François Alcover_, Feb 21 2012 *)
%Y A059024 Row sums give A057814.
%Y A059024 Cf. A008299, A059022, A059023, A059025.
%K A059024 nonn,tabf,nice
%O A059024 5,7
%A A059024 Barbara Haas Margolius (margolius(AT)math.csuohio.edu), Dec 14 2000