A271617 T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.
1, 1, 3, 1, 3, 2, 1, 4, 17, 6, 1, 4, 17, 114, 240, 1, 4, 26, 114, 240, 2238, 1, 4, 26, 307, 2571, 2238, 2196, 1, 4, 27, 307, 2571, 42702, 216318, 37004, 1, 4, 27, 406, 7764, 42702, 216318, 5622392, 20454036, 1, 4, 27, 406, 7764, 222936, 3243689, 5622392, 20454036, 970623228
Offset: 1
Examples
Some solutions for n=4 k=4 .....5........5........0........5........0........6........5........5 ....2.0......2.0......0.5......2.0......6.0......5.1......2.0......2.6 ...6.6.6....0.5.5....5.2.5....0.0.0....0.1.6....2.0.0....5.4.3....5.5.1 ..0.1.1.1..0.2.2.0..2.0.2.0..4.3.4.3..0.4.3.1..0.4.3.0..2.0.4.3..2.2.4.3 Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
Links
- Alois P. Heinz, Antidiagonals n = 1..20, flattened (first 16 antidiagonals from R. H. Hardin)
Comments