130848

Appears in sequences

• Triangle read by rows: T(n, k) = [x^k] p(x, n), where p(x, n) = (-1)^n*(1 - 2*x)^(n + 1)* Sum_{j >= 0} (3*j + 2)^n*(2*x)^j.at n=26A154594
• Number of length n+2 0..1 arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=15A250313
• Number of (n+1)X(2+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=6A250626
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=34A250632
• Number of (7+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=1A250639