24892
domain: N
Appears in sequences
- Number of nonequivalent dissections of a polygon into n triangles by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=11A003446
- Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.at n=48A059438
- Triangle read by rows. T(n, k) = A059438(n, k) for 1 <= k <= n, and T(n, 0) = n^0.at n=59A085771
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (1, 0)}.at n=13A151499
- Number of binary strings of length n with equal numbers of 01010 and 10101 substrings.at n=15A164263
- Number of 9-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=6A187383
- Number of partitions p of n such that max(p) - min(p) is not a part of p.at n=38A238494
- Number of length 2+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=26A245871
- Index of record values in A247190.at n=40A250985
- Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n elements with n-k elements in its connectivity set.at n=51A263484