175896

Appears in sequences

• Number of driving-point impedances of an n-terminal network.at n=9A003128
• Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.at n=47A049020
• Triangular T(n,k) which contains in column k >= 0 the elements of the Stirling transform of the unsigned sequence Stirling1(j+k,j), j >= 0.at n=37A118984
• Nondescending wiggly sums: number of sums adding to n in which terms alternately do not decrease and do not increase.at n=23A129852
• Triangle read by rows: T(n,k) = Sum_{j=k..n} binomial(n,j)*Stirling_2(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1.at n=38A244489
• Triangle read by rows of partial Bell polynomials B_{n,k}(x_1,...,x_{n-k+1}) evaluated at 2, 2, 12, 72, ..., (n-k)(n-k+1)!, divided by (n-k+1)!, n >= 1, 1 <= k <= n.at n=50A353132