63805
domain: N
Appears in sequences
- Sum of largest parts (counted with multiplicity) of all partitions of n.at n=30A092321
- Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n.at n=31A112493
- Fourth column of triangle A112493 used for e.g.f.s of Stirling2 diagonals.at n=4A112496
- Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)).at n=33A124324