125895
domain: N
Appears in sequences
- a(n) = Sum_{k=0..n} (k+1) * A026659(n,k).at n=13A026980
- 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=60A111246
- Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=11A136476
- Eigentriangle by rows, termwise products of A078812 and its eigensequence, A125274.at n=42A144254
- 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=62A144385
- Triangle in A144385 with rows left-adjusted.at n=41A144399