650644
domain: N
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=48A001100
- Antichains (or order ideals) in the poset 2*2*4*n or size of the distributive lattice J(2*2*4*n).at n=4A006361
- Number of permutations of length n with exactly 3 rising or falling successions.at n=10A086854