786609

Appears in sequences

• From George Gilbert's marks problem: jumping 4 marks at a time (initial positions).at n=32A019595
• Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=4A236822
• Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=1A236825
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=16A236828
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=19A236828