56660

Appears in sequences

• a(n+1) = n*a(n) + a(n-1) with a(0)=1, a(1)=0.at n=9A001053
• T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).at n=40A059587
• Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.at n=45A062323
• Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k.at n=47A062323
• Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0, 1, 1, 3, 10, 43, 225, 1393, 9976, 81201, ... Then S(0), S(1), S(2), ... are written vertically, next to each other, with the initial term of each on the next row down.at n=37A102472
• Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0,1,1,3,10,43,225,1393,9976,81201, ... Then S(0), S(1), S(2), ... are written next to each other, vertically, with the initial term of each on the next row down. The order of the terms in the rows are then reversed.at n=43A102473
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=45A121554
• Array t(n, k) = (k*(n-1) +2-k)*t(n-1, k) + k*t(n-2, k), with t(1, k) = 1, t(2, k) = 2, read by antidiagonals.at n=28A144446
• Antidiagonal triangle sequence based on recursion: f(n,a)=a*n*f(n-1,a)+f(n-2,a).at n=44A173003
• T(n,k) = 2*(K(n,2)*I(k,2) - (-1)^(n+k)*I(n,2)*K(k,2)), where I(n,x) and K(n,x) are Bessel functions; triangle read by rows for 0 <= k <= n.at n=46A246654