95503
domain: N
Appears in sequences
- Sum of multinomial coefficients (n_1+n_2+...)!/(n_1!*n_2!*...) where (n_1, n_2, ...) runs over all integer partitions of n.at n=8A005651
- Start with 1 and repeatedly reverse the digits and add 66 to get the next term.at n=31A118200
- a(n) = Sum_{k=0..binomial(n,2)} (-1)^k*A152534(n,k).at n=16A152536
- Rectangular table where T(n,k) is the sum of the n-th powers of the k-th row of multinomial coefficients in triangle A036038 for n>=0, k>=0, as read by antidiagonals.at n=53A183610
- Number of n-length words w over an 8-ary alphabet {a1,a2,...,a8} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a8) >= 0, where #(w,x) counts the letters x in word w.at n=8A226878
- Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 0, where #(w,x) counts the letters x in word w.at n=8A226879
- Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 0, where #(w,x) counts the letters x in word w.at n=8A226880
- Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=44A261719
- Number of partitions of n where each part i is marked with a word of length i over an octonary alphabet whose letters appear in alphabetical order and all eight letters occur at least once in the partition.at n=0A293372
- Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=44A309973
- Sum T(n,k) of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=36A327801
- Sum of numbers of y-multisets of divisors of x for each x >= 1, y >= 0, x + y = n.at n=31A343661