76110
domain: N
Appears in sequences
- Number of partitions of n with more even parts than odd parts.at n=52A108949
- Number of Hi-Lo arrangements HL(m,n) of a deck with n suits and m ranks in each suit, m>=1, n>=1.at n=36A143381
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=13A148022
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 0), (1, 1, -1)}.at n=11A148330
- Number of permutations of length n within distance 5.at n=9A154654
- Number of (n+1) X (6+1) 0..1 arrays with nondecreasing min(x(i,j), x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=4A250795
- Number of (5+1) X (n+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=5A250802
- Triangular array read by rows. T(n,k) is the number of idempotent Boolean relation matrices on [n] with exactly k reflexive points, n >= 0, 0 <= k <= n.at n=23A360984
- Number A(n,k) of acyclic orientations of the complete tripartite graph K_{n,n,k}; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=19A372254
- Number T(n,k,j) of acyclic orientations of the complete tripartite graph K_{n,k,j}; triangle of triangles T(n,k,j), n>=0, k=0..n, j=0..k, read by rows.at n=31A372261