102025
domain: N
Appears in sequences
- Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.at n=59A111246
- Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n).at n=46A144385
- Triangle in A144385 with rows left-adjusted.at n=31A144399
- a(n) = 7^n - 5^n + 1^n.at n=6A155640
- Number of (n+1) X (5+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=12A250726
- Numbers that have exactly 7 representations as a k-gonal number, P(n,k) = n*((k-2)*n - (k-4))/2, k and n >= 3.at n=19A321157