A193986 T(n,k) is the number of ways to arrange k nonattacking triangular rooks on an nXnXn triangular grid.
1, 0, 3, 0, 0, 6, 0, 0, 3, 10, 0, 0, 0, 15, 15, 0, 0, 0, 2, 45, 21, 0, 0, 0, 0, 23, 105, 28, 0, 0, 0, 0, 0, 127, 210, 36, 0, 0, 0, 0, 0, 18, 468, 378, 45, 0, 0, 0, 0, 0, 0, 233, 1352, 630, 55, 0, 0, 0, 0, 0, 0, 6, 1449, 3310, 990, 66, 0, 0, 0, 0, 0, 0, 0, 270, 6213, 7190, 1485, 78, 0, 0, 0, 0
Offset: 1
Examples
Some solutions for n=5 k=3 ......0..........0..........0..........0..........1..........0..........0 .....0.0........0.0........0.0........0.1........0.0........0.0........0.1 ....0.1.0......0.0.1......1.0.0......0.0.0......0.0.0......1.0.0......1.0.0 ...0.0.0.1....1.0.0.0....0.0.1.0....0.0.1.0....0.1.0.0....0.0.1.0....0.0.1.0 ..0.0.1.0.0..0.0.0.1.0..0.1.0.0.0..1.0.0.0.0..0.0.0.1.0..0.0.0.0.1..0.0.0.0.0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..551
Comments