151635
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k triple descents (n>=0,0<=k<=n-3). We say that i is a triple descent of a permutation p if p(i) > p(i+1) > p(i+2) > p(i+3).at n=33A220183
- Number of (n+2)X(1+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5.at n=2A251985
- Number of (n+2)X(3+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5.at n=0A251987
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5.at n=3A251989
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5.at n=5A251989
- Expansion of g.f. A(x) satisfying A( x*A(x)^2 + x*A(x)^3 ) = A(x)^3.at n=14A371709