94827

Appears in sequences

• a(n) = Bell(n+1)-Bell(n)-1, n>0.at n=9A052834
• Triangle, T(n, k, m) = 1 if (k=0 or k=n), otherwise (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*A157636(n, k)*T(n-2, k-1, m) for m = 1, read by rows.at n=31A157637
• Triangle, T(n, k, m) = 1 if (k=0 or k=n), otherwise (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*A157636(n, k)*T(n-2, k-1, m) for m = 1, read by rows.at n=32A157637
• a(n) is the sum of distinct sums of all subsets with two or more elements of {1, 2, ..., n}.at n=29A375764