173860

Appears in sequences

• Number of n X n 0..2 arrays with row sums equal and no column sum equal to the previous.at n=3A202712
• T(n,k)=Number of n X n 0..k arrays with row sums equal and no column sum equal to the previous.at n=13A202714
• Number of 4X4 0..n arrays with row sums equal and no column sum equal to the previous.at n=1A202716
• Number of nX4 0..2 arrays with row sums equal and column sums unequal to adjacent columns.at n=3A203487
• T(n,k)=Number of nXk 0..2 arrays with row sums equal and column sums unequal to adjacent columns.at n=24A203491
• Number of 4Xn 0..2 arrays with row sums equal and column sums unequal to adjacent columns.at n=3A203494
• Number T(n,k) of defective parking functions of length n and defect k; triangle T(n,k), n>=0, 0<=k<=max(0,n-1), read by rows.at n=24A264902
• Number of words on {1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,...,n,n,n,n} avoiding the pattern 123.at n=4A266739
• Number of defective parking functions of length n and defect two.at n=4A291128
• Number of self-avoiding closed paths in the 4 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.at n=10A333760
• G.f. = ((2+3*x)/(1-x^2-x^3))^2.at n=27A350602