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!)
A327117 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that a color pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. 9

%I #29 Oct 04 2019 13:10:27

%S 1,0,1,0,1,2,0,1,4,5,0,1,7,18,15,0,1,10,45,84,52,0,1,14,94,298,415,

%T 203,0,1,18,174,844,1995,2178,877,0,1,23,300,2081,7440,13638,12131,

%U 4140,0,1,28,486,4652,23670,64898,95823,71536,21147,0,1,34,756,9682,67390,259599,566447,694676,445356,115975

%N Number T(n,k) of colored integer partitions of n using all colors of a k-set such that a color pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

%C The sequence of column k satisfies a linear recurrence with constant coefficients of order k*2^(k-1) = A001787(k).

%H Alois P. Heinz, <a href="/A327117/b327117.txt">Rows n = 0..140, flattened</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>

%F Sum_{k=1..n} k * T(n,k) = A327118(n).

%e T(3,2) = 4: 2ab1a, 2ab1b, 1a1a1b, 1a1b1b.

%e Triangle T(n,k) begins:

%e 1;

%e 0, 1;

%e 0, 1, 2;

%e 0, 1, 4, 5;

%e 0, 1, 7, 18, 15;

%e 0, 1, 10, 45, 84, 52;

%e 0, 1, 14, 94, 298, 415, 203;

%e 0, 1, 18, 174, 844, 1995, 2178, 877;

%e 0, 1, 23, 300, 2081, 7440, 13638, 12131, 4140;

%e 0, 1, 28, 486, 4652, 23670, 64898, 95823, 71536, 21147;

%e 0, 1, 34, 756, 9682, 67390, 259599, 566447, 694676, 445356, 115975;

%e ...

%p C:= binomial:

%p b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add(

%p b(n-i*j, min(n-i*j, i-1), k)*C(C(k, i)+j-1, j), j=0..n/i)))

%p end:

%p T:= (n, k)-> add(b(n$2, i)*(-1)^(k-i)*C(k, i), i=0..k):

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

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i<1, 0, Sum[b[n - i j, Min[n - i j, i - 1], k] Binomial[Binomial[k, i] + j - 1, j], {j, 0, n/i}]]];

%t T[n_, k_] := Sum[b[n, n, i] (-1)^(k - i) Binomial[k, i], {i, 0, k}];

%t Table[T[n, k], {n, 0, 12}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Oct 04 2019, after _Alois P. Heinz_ *)

%Y Columns k=0-3 give: A000007, A057427, A014616(n-1) for n>1, A327842.

%Y Main diagonal gives A000110.

%Y Row sums give A116540.

%Y T(2n,n) gives A327843.

%Y Cf. A001787, A255903, A326914, A326962, A327116, A327118.

%K nonn,tabl

%O 0,6

%A _Alois P. Heinz_, Sep 13 2019

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 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)