64968

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=39A001100
• Number of permutations of length n with exactly 3 rising or falling successions.at n=9A086854
• Least n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers.at n=15A112510
• Equals one maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nX4 array.at n=3A220544
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nXk array.at n=24A220545