160089

Appears in sequences

• A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-6), n >= 7.at n=27A001635
• Number of nX4 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A299550
• Number of nX7 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299553
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=48A299554
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=51A299554