519616

Appears in sequences

• Number of routes of length 2n on the sides of an octagon from a point to opposite point.at n=11A060995
• Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.at n=21A068912
• Number of (n+1)X(1+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2X2 subblock.at n=6A236089
• Number of (n+1)X(7+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2X2 subblock.at n=0A236095
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2 X 2 subblock.at n=21A236096
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2 X 2 subblock.at n=27A236096