STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A257740
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
(history; published version)
(history; published version)
EXAMPLE
...
STATUS
approved
editing
STATUS
editing
approved
STATUS
editing
approved
EXTENSIONS
Name changed by Alois P. Heinz, Sep 21 2018
NAME
Triangle Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows: row n is the inverse binomial transform of the n-th row of array A144074, which has the Euler transform of the powers of k in column k.
DATA
1, 0, 1, 0, 2, 3, 0, 3, 14, 13, 0, 5, 49, 114, 73, 0, 7, 148, 672, 1028, 501, 0, 11, 427, 3334, 9182, 10310, 4051, 0, 15, 1170, 15030, 66584, 129485, 114402, 37633, 0, 22, 3150, 63978, 428653, 1285815, 1918083, 1394414, 394353, 0, 30, 8288, 261880, 2557972, 11117600, 24917060, 30044014, 18536744, 4596553
COMMENTS
Row n is the inverse binomial transform of the n-th row of array A144074, which has the Euler transform of the powers of k in column k.
EXAMPLE
T(2,2) = 3: {ab}, {ba}, {a,b}.
T(3,2) = 14: {aab}, {aba}, {abb}, {baa}, {bab}, {bba}, {a,ab}, {a,ba}, {a,bb}, {aa,b}, {ab,b}, {b,ba}, {a,a,b}, {a,b,b}.