70631

Appears in sequences

• Near-Bell numbers: partitions of an n-multiset with multiplicities 1, 1, 1, ..., 1, 2.at n=9A035098
• Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros.at n=53A126442
• Diagonal element T(n,n) of the infinite array with T(n,1) = T(1,n) = Fibonacci(n) and recursively T(n,k) = T(n-1,k-1) + T(n,k-1) + T(n-1,k).at n=7A193913
• Number of powerful uniform rooted trees with n nodes.at n=40A318689
• Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=57A346426
• Number of partitions of the (n+8)-multiset {0,...,0,1,2,...,8} with n 0's.at n=2A346861
• Number of partitions of the (n+9)-multiset {1,2,...,n,1,2,...,9}.at n=1A346886
• For n >= 2, a(n) = a(n-1) + a(n-2) + A051697(n), a(0)=0, a(1)=1.at n=21A363707