31345

Appears in sequences

• a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=40A063676
• a(-1)=0. a(n)=a(n-1)^2+2^n.at n=4A168320
• Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A300315
• Number of nX5 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A300318
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=40A300321
• T(n,k) is the number of length-n weak ascent sequences (prefixed with a zero) with k weak ascents, triangle read by rows.at n=51A369321