56221
domain: N
Appears in sequences
- T(n,n-3), array T given by A047000.at n=9A047005
- Triangular array read by rows, T(n,k) = number of partial functions on {1,2,...,n} with exactly k cycles.at n=22A216520
- a(n) is the total number of down steps between the (n-1)-th and n-th up steps in all 2_1-Dyck paths of length 3*n. A 2_1-Dyck path is a lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0 and stays above the line y = -1.at n=7A334977
- Number of subsets of {1,2,...,n} such that no two elements differ by 2, 4, or 5.at n=30A375983