55974
domain: N
Appears in sequences
- Number of partitions of n^2-n into parts not greater than n.at n=8A206240
- Number of partitions of n*(n-1)*(n-2)/6 into parts that are at most n.at n=8A258300
- Triangle read by rows where T(n,k) is the number of integer partitions of 2^n with mean 2^k, 0 <= k <= n.at n=24A327483
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into exactly n parts.at n=63A347617
- Number of integer partitions of n satisfying (length) = (mean). Partitions of n into sqrt(n) parts.at n=64A364055
- Number of partitions of 2^(2n) into 2^n parts.at n=3A365881