login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319298 Number T(n,k) of entries in the k-th blocks of all set partitions of [n] when blocks are ordered by increasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows. 14

%I #50 Aug 24 2021 08:11:33

%S 1,3,1,7,7,1,21,25,13,1,66,101,71,21,1,258,366,396,166,31,1,1079,1555,

%T 1877,1247,337,43,1,4987,7099,9199,7855,3305,617,57,1,25195,34627,

%U 47371,47245,27085,7681,1045,73,1,136723,184033,253108,284968,203278,79756,16126,1666,91,1

%N Number T(n,k) of entries in the k-th blocks of all set partitions of [n] when blocks are ordered by increasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.

%H Alois P. Heinz, <a href="/A319298/b319298.txt">Rows n = 1..141, flattened</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

%e The 5 set partitions of {1,2,3} are:

%e 1 |2 |3

%e 1 |23

%e 2 |13

%e 3 |12

%e 123

%e so there are 7 elements in the first (smallest) blocks, 7 in the second blocks and only 1 in the third blocks.

%e Triangle T(n,k) begins:

%e 1;

%e 3, 1;

%e 7, 7, 1;

%e 21, 25, 13, 1;

%e 66, 101, 71, 21, 1;

%e 258, 366, 396, 166, 31, 1;

%e 1079, 1555, 1877, 1247, 337, 43, 1;

%e 4987, 7099, 9199, 7855, 3305, 617, 57, 1;

%e 25195, 34627, 47371, 47245, 27085, 7681, 1045, 73, 1;

%e ...

%p b:= proc(n, l) option remember; `if`(n=0, add(l[i]*

%p x^i, i=1..nops(l)), add(binomial(n-1, j-1)*

%p b(n-j, sort([l[], j])), j=1..n))

%p end:

%p T:= n-> (p-> (seq(coeff(p, x, i), i=1..n)))(b(n, [])):

%p seq(T(n), n=1..12);

%p # second Maple program:

%p b:= proc(n, i, t) option remember; `if`(n=0, [1, 0], `if`(i>n, 0,

%p add((p-> p+`if`(t>0 and t-j<1, [0, p[1]*i], 0))(b(n-i*j, i+1,

%p max(0, t-j))/j!*combinat[multinomial](n, i$j, n-i*j)), j=0..n/i)))

%p end:

%p T:= (n, k)-> b(n, 1, k)[2]:

%p seq(seq(T(n, k), k=1..n), n=1..12); # _Alois P. Heinz_, Mar 02 2020

%t b[n_, l_] := b[n, l] = If[n == 0, Sum[l[[i]] x^i, {i, 1, Length[l]}], Sum[ Binomial[n-1, j-1] b[n-j, Sort[Append[l, j]]], {j, 1, n}]];

%t T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 1, n}]][b[n, {}]];

%t Table[T[n], {n, 1, 12}] // Flatten (* _Jean-François Alcover_, Dec 28 2018, after _Alois P. Heinz_ *)

%Y Column k=1-10 gives A097147, A332942, A332943, A332944, A332945, A332946, A332947, A332948, A332949, A332950.

%Y Row sums give A070071.

%Y Cf. A319375, A322383.

%K nonn,tabl

%O 1,2

%A _Alois P. Heinz_, Dec 07 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 11:48 EDT 2024. Contains 371711 sequences. (Running on oeis4.)