8828820
domain: N
Appears in sequences
- Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n.at n=42A112493
- Number of ascent sequences of length n with exactly eight flat steps.at n=7A242161
- Number of ascent sequences of length 2n with exactly n flat steps.at n=8A242164
- Numbers x such that there exist a pair y, n with x < y, x != n and y != n that makes {x,y,n,n} an amicable multiset.at n=21A273970
- Number of set partitions of [n] having exactly six blocks of size > 1.at n=2A290035
- Numbers of 3-regular one-face rooted maps on non-orientable surfaces.at n=4A348796