143571
domain: N
Appears in sequences
- a(n) = floor(log(n)*exp(n)).at n=10A058750
- Number of nondecreasing integer sequences of length 22 with sum zero and sum of absolute values 2n.at n=17A158156
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2).at n=31A162975
- Number of permutations of [n] having exactly one doubledescent.at n=9A274997