52856
domain: N
Appears in sequences
- Number of ways to place 6 nonattacking queens on a 6 X n board.at n=12A061992
- Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.at n=46A102437
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p.at n=43A241829
- Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=71A269133
- Expansion of e.g.f.: exp(x) / (1 - 6*x)^(1/6).at n=5A347014