4780656

Appears in sequences

• Number of paths in the first quadrant from (0,0) to (n,0) using steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0).at n=16A128720
• Number of (n+1) X (1+1) 0..3 arrays colored with the maximum plus the minimum minus the upper median minus the lower median of every 2 X 2 subblock.at n=4A236589
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock.at n=10A236592
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock.at n=14A236592