A226884 -id:A226884 - cp's OEIS frontend

A226874 Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.

1, 0, 1, 0, 1, 2, 0, 1, 3, 6, 0, 1, 10, 12, 24, 0, 1, 15, 50, 60, 120, 0, 1, 41, 180, 300, 360, 720, 0, 1, 63, 497, 1260, 2100, 2520, 5040, 0, 1, 162, 1484, 6496, 10080, 16800, 20160, 40320, 0, 1, 255, 5154, 20916, 58464, 90720, 151200, 181440, 362880

Offset: 0

Alois P. Heinz, Jun 21 2013

T(n,k) is the sum of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts that form a multiset of size k.

			T(4,2) = 10: aaab, aaba, aabb, abaa, abab, abba, baaa, baab, baba, bbaa.
T(4,3) = 12: aabc, aacb, abac, abca, acab, acba, baac, baca, bcaa, caab, caba, cbaa.
T(5,2) = 15: aaaab, aaaba, aaabb, aabaa, aabab, aabba, abaaa, abaab, ababa, abbaa, baaaa, baaab, baaba, babaa, bbaaa.
Triangle T(n,k) begins:
  1;
  0,  1;
  0,  1,   2;
  0,  1,   3,    6;
  0,  1,  10,   12,   24;
  0,  1,  15,   50,   60,   120;
  0,  1,  41,  180,  300,   360,   720;
  0,  1,  63,  497, 1260,  2100,  2520,  5040;
  0,  1, 162, 1484, 6496, 10080, 16800, 20160, 40320;
  ...

Alois P. Heinz, Rows n = 0..140, flattened
Wikipedia, Iverson bracket
Wikipedia, Multinomial coefficients
Wikipedia, Partition (number theory)

Columns k=0-10 give: A000007, A057427, A226881, A226882, A226883, A226884, A226885, A226886, A226887, A226888, A226889.
Main diagonal gives: A000142.
Row sums give: A005651.
T(2n,n) gives A318796.
Cf. A131632, A285824, A292222, A327803.

b:= proc(n, i, t) option remember;
      `if`(t=1, 1/n!, add(b(n-j, j, t-1)/j!, j=i..n/t))
    end:
T:= (n, k)-> `if`(n*k=0, `if`(n=k, 1, 0), n!*b(n, 1, k)):
seq(seq(T(n, k), k=0..n), n=0..12);
# second Maple program:
b:= proc(n, i) option remember; expand(
      `if`(n=0, 1, `if`(i<1, 0, add(x^j*b(n-i*j, i-1)*
      combinat[multinomial](n, n-i*j, i$j), j=0..n/i))))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n$2)):
seq(T(n), n=0..12);

b[n_, i_, t_] := b[n, i, t] = If[t == 1, 1/n!, Sum[b[n - j, j, t - 1]/j!, {j, i, n/t}]]; t[n_, k_] := If[n*k == 0, If[n == k, 1, 0], n!*b[n, 1, k]]; Table[Table[t[n, k], {k, 0, n}], {n, 0, 12}] // Flatten (* Jean-François Alcover, Dec 13 2013, translated from first Maple *)

T(n)={Vec(serlaplace(prod(k=1, n, 1/(1-y*x^k/k!) + O(x*x^n))))}
{my(t=T(10)); for(n=1, #t, for(k=0, n-1, print1(polcoeff(t[n], k), ", ")); print)} \\ Andrew Howroyd, Dec 20 2017

T(n,k) = A226873(n,k) - [k>0] * A226873(n,k-1).

A214311 a(n) is the number of representative five-color bracelets (necklaces with turning over allowed) with n beads, for n >= 5.

Original entry on oeis.org

12, 30, 150, 633, 3260, 16212, 66810, 298495, 1410402, 6403842, 31103899, 135342046, 633228696, 2936824916, 13676037486, 65355191817, 298065986582, 1398226666434, 6585151203697, 30958838054304, 148994847644780

Offset: 5

Wolfdieter Lang, Aug 08 2012

nonn

This is the fifth column (m=5) of triangle A213940.
The relevant p(n,5)= A008284(n,5) representative color multinomials have exponents (signatures) from the five-part partitions of n, written with nonincreasing parts. E.g., n=7: [3,1,1,1,1] and [2,2,1,1,1] (p(7,5)=2). The corresponding representative bracelets have the five-color multinomials c[1]^3*c[2]*c[3]*c[4]*c[5] and c[1]^2*c[2]^2*c[3]*c[4]*c[5].
Number of n-length bracelets w over a 5-ary alphabet {a1,a2,...,a5} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a5) >= 1, where #(w,x) counts the letters x in word w (bracelet analog of A226884). The number of 5 color bracelets up to permutations of colors is given by A056360. - Andrew Howroyd, Sep 26 2017

			a(5) = A213940(5,5) = A213939(5,7) = 12 from the representative bracelets (with colors j for c[j], j=1,...,5) 12345, 12354, 12435, 12453, 12534, 12543, 13245, 13254, 13425, 13524, 14235 and 14325, all taken cyclically.

Andrew Howroyd, Table of n, a(n) for n = 5..200

Cf. A213939, A213940, A214309 (m=4 case), A214313 (m=5, all bracelets).

Cf. A056360, A226884.

a(n) = A213940(n,5), n >= 5.

a(n) = sum(A213939(n,k),k= b(n,5)..b(n,6)-1), n>=6, with b(n,m) = A214314(n,m) the position where the first m part partition of n appears in the Abramowitz-Stegun ordering of partitions (see A036036 for the reference and a historical comment). a(5) = A213939(5,b(5,5)) = A213939(5,7) = 12.

cp's OEIS Frontend

A226874 Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula