13178880
domain: N
Appears in sequences
- Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k 3-cycles. n>=0, 0<=k<=floor(n/3).at n=15A185070
- 7-quantum transitions in systems of N >= 7 spin 1/2 particles, in columns by combination indices.at n=26A213349
- Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle.at n=25A362144