110320

Appears in sequences

• Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.at n=37A001100
• Number of permutations of length n with exactly 1 rising or falling succession.at n=9A086852
• Number of semistandard Young tableaux over all partitions of 6 with maximal element <= n.at n=10A210428
• Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=5A298224
• Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=5A298228
• Triangle read by rows: T(n,k) gives the number of permutations of length n containing exactly k instances of the 1-box pattern; 0 <= k <= n.at n=47A346462