29439

Appears in sequences

• Triangle T(n,k) (0<= k <=n) read by rows. Left edge is 1, 0, 0, ... Otherwise each entry is sum of entry to left, entries immediately above it to left and right and entry directly above it 2 rows back.at n=44A059283
• Right edge of triangle in A059283.at n=8A059284
• Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A300104
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A300106
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A300108
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=41A300108
• a(n) is the number of binary strings of length n whose shortest run of 1s is of length 1.at n=15A384153