59332
domain: N
Appears in sequences
- Number of permutations of length n with 2 consecutive ascending pairs.at n=8A000274
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=42A010027
- Number of reversible strings with n-1 beads of 2 colors. 5 beads are black. String is not palindromic.at n=23A032092
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) = 1.at n=38A123513
- Triangle read by rows: T(n, k) = Sum_{j=0..n} C(-j-1, -n-1)*L(j, k), L the unsigned Lah numbers A271703, for n >= 0 and 0 <= k <= n.at n=38A271706
- p-INVERT of the odd positive integers (A005408), where p(S) = 1 - S - S^2.at n=8A289786