91628

Appears in sequences

• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one diagonal or antidiagonal neighbor and the top left element equal to 0.at n=57A268142
• Number of 3 X n arrays containing n copies of 0..3-1 with every element equal to at least one diagonal or antidiagonal neighbor and the top left element equal to 0.at n=8A268143
• Number of Dyck paths of semilength n such that the maximal number of peaks per level equals ten.at n=7A288751