120865
domain: N
Appears in sequences
- Number of partitions of n where the difference between consecutive parts is at most 3.at n=56A238863
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=12A298225
- Expansion of e.g.f. exp((1 - exp(-6*x))/6).at n=8A318181
- Triangle read by rows. T(n, k) = k^n * BellPolynomial(n, -1/k) for k > 0, if k = 0 then T(n, k) = k^n.at n=42A350261
- Triangle read by rows. T(n, k) = B(n, n - k + 1) where B(n, k) = k^n * BellPolynomial(n, -1/k) for k > 0, if k = 0 then B(n, k) = k^n.at n=39A350262