115584

Appears in sequences

• Schroeder paths with two rise colors and two level colors.at n=6A156017
• a(n) = Sum_{k=0..n} C(n,k)*sigma(n,k)*sigma(n,n-k) for n>0 with a(0)=1.at n=5A179503
• Triangle T(n,k) for A(x)^k=sum(n>=k T(n,k)*x^n), where o.g.f. A(x) satisfies A(x)=(a+b*x*A(x))/(c-d*x*A(x)), a=1,b=2,c=1,d=2.at n=21A183875
• Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=5A237377
• Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237382
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=15A237384
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=20A237384
• Triangle read by rows, coefficients of polynomials in t = log(x) of the n-th derivative of x^(x^2), evaluated at x = 1. T(n, k) with n >= 0 and 0 <= k <= n.at n=41A293473
• Numbers k such that k = Product (p_j^e_j) = Product (p_j*(e_j + 1)).at n=40A304410