login
A271684
T(n,k)=Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than k-1 elements moved to themselves.
8
0, 1, 2, 1, 5, 4, 1, 5, 22, 132, 1, 6, 43, 532, 3440, 1, 6, 51, 1060, 19448, 358792, 1, 6, 60, 1564, 52748, 2249488, 71771952, 1, 6, 60, 1939, 96249, 7094704, 556148184, 39547904272, 1, 6, 61, 2113, 139023, 15313428, 2145306564, 357523207792
OFFSET
1,3
COMMENTS
Table starts
........0.........1..........1..........1...........1...........1........1
........2.........5..........5..........6...........6...........6........6
........4........22.........43.........51..........60..........60.......61
......132.......532.......1060.......1564........1939........2113.....2230
.....3440.....19448......52748......96249......139023......172410...193950
...358792...2249488....7094704...15313428....25765212....36413940.45502450
.71771952.556148184.2145306564.5570048178.11078521995.18170233119
LINKS
EXAMPLE
Some solutions for n=4 k=4
.....6........5........6........5........6........6........5........5
....6.1......2.5......2.3......2.6......2.3......2.3......2.0......2.5
...2.3.6....6.4.1....5.3.3....6.0.1....6.0.6....6.6.0....5.6.6....5.2.6
..0.0.2.3..2.3.0.0..4.4.2.0..2.3.0.0..2.3.0.1..0.1.1.0..2.2.3.1..2.4.3.1
Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
CROSSREFS
Sequence in context: A171090 A141506 A345454 * A194682 A274105 A366156
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Apr 12 2016
STATUS
approved